Base | Representation |
---|---|
bin | 1010111010100110111100… |
… | …1000011010110111110111 |
3 | 1120111101021020021021211201 |
4 | 2232221233020122313313 |
5 | 3033120100243300343 |
6 | 41305351043313331 |
7 | 2346054553060420 |
oct | 256515710326767 |
9 | 46441236237751 |
10 | 12002003103223 |
11 | 3908025950a11 |
12 | 141a09a67b847 |
13 | 690a266b2573 |
14 | 2d6c85a44647 |
15 | 15c2edbe794d |
hex | aea6f21adf7 |
12002003103223 has 8 divisors (see below), whose sum is σ = 13755432130848. Its totient is φ = 10258288364544.
The previous prime is 12002003103221. The next prime is 12002003103257. The reversal of 12002003103223 is 32230130020021.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 12002003103223 - 21 = 12002003103221 is a prime.
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 12002003103223.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12002003103221) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2428569586 + ... + 2428574527.
It is an arithmetic number, because the mean of its divisors is an integer number (1719429016356).
Almost surely, 212002003103223 is an apocalyptic number.
12002003103223 is a deficient number, since it is larger than the sum of its proper divisors (1753429027625).
12002003103223 is an equidigital number, since it uses as much as digits as its factorization.
12002003103223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4857144473.
The product of its (nonzero) digits is 432, while the sum is 19.
Adding to 12002003103223 its reverse (32230130020021), we get a palindrome (44232133123244).
The spelling of 12002003103223 in words is "twelve trillion, two billion, three million, one hundred three thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.678 sec. • engine limits •