Base | Representation |
---|---|
bin | 1100000010001101100000… |
… | …0100001011101111011011 |
3 | 1201211222102111020001012221 |
4 | 3000203120010023233123 |
5 | 3213243342301401003 |
6 | 44050430504444511 |
7 | 2533663242216244 |
oct | 300433004135733 |
9 | 51758374201187 |
10 | 13232124247003 |
11 | 42417921a4162 |
12 | 1598583779737 |
13 | 74ca26499a6c |
14 | 33a61c70dccb |
15 | 17e2e7e8b7bd |
hex | c08d810bbdb |
13232124247003 has 4 divisors (see below), whose sum is σ = 13449044316688. Its totient is φ = 13015204177320.
The previous prime is 13232124246989. The next prime is 13232124247019. The reversal of 13232124247003 is 30074242123231.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13232124247003 is a prime.
It is a super-2 number, since 2×132321242470032 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 13232124247003.
It is not an unprimeable number, because it can be changed into a prime (13232124247073) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 108460034751 + ... + 108460034872.
It is an arithmetic number, because the mean of its divisors is an integer number (3362261079172).
Almost surely, 213232124247003 is an apocalyptic number.
13232124247003 is a deficient number, since it is larger than the sum of its proper divisors (216920069685).
13232124247003 is an equidigital number, since it uses as much as digits as its factorization.
13232124247003 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 216920069684.
The product of its (nonzero) digits is 48384, while the sum is 34.
The spelling of 13232124247003 in words is "thirteen trillion, two hundred thirty-two billion, one hundred twenty-four million, two hundred forty-seven thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •