Base | Representation |
---|---|
bin | 1001000110001100110011… |
… | …0100001111100001011101 |
3 | 1022102012012221121010001020 |
4 | 2101203030310033201131 |
5 | 2302333320222042341 |
6 | 33134524402234353 |
7 | 2051425601115426 |
oct | 221431464174135 |
9 | 38365187533036 |
10 | 10002120112221 |
11 | 320696a059786 |
12 | 11565899559b9 |
13 | 5772714688b3 |
14 | 26816893264d |
15 | 1252a112e566 |
hex | 918ccd0f85d |
10002120112221 has 8 divisors (see below), whose sum is σ = 13336205323584. Its totient is φ = 6668057487840.
The previous prime is 10002120112151. The next prime is 10002120112241. The reversal of 10002120112221 is 12221102120001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10002120112221 - 225 = 10002086557789 is a prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 10002120112221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10002120112241) 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, 4584960 + ... + 6405161.
It is an arithmetic number, because the mean of its divisors is an integer number (1667025665448).
Almost surely, 210002120112221 is an apocalyptic number.
It is an amenable number.
10002120112221 is a deficient number, since it is larger than the sum of its proper divisors (3334085211363).
10002120112221 is a wasteful number, since it uses less digits than its factorization.
10002120112221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11293491.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 10002120112221 its reverse (12221102120001), we get a palindrome (22223222232222).
The spelling of 10002120112221 in words is "ten trillion, two billion, one hundred twenty million, one hundred twelve thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •