Base | Representation |
---|---|
bin | 1010111010100111010011… |
… | …1010100000100111010110 |
3 | 1120111101111222211020212111 |
4 | 2232221310322200213112 |
5 | 3033120300112320042 |
6 | 41305404430541234 |
7 | 2346060141516265 |
oct | 256516472404726 |
9 | 46441458736774 |
10 | 12002100120022 |
11 | 3908075695091 |
12 | 141a10706781a |
13 | 690a4082025c |
14 | 2d6c9489a5dc |
15 | 15c3074ad517 |
hex | aea74ea09d6 |
12002100120022 has 8 divisors (see below), whose sum is σ = 18096430751496. Its totient is φ = 5969956536192.
The previous prime is 12002100119939. The next prime is 12002100120067. The reversal of 12002100120022 is 22002100120021.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 12002100119984 and 12002100120011.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 15546761428 + ... + 15546762199.
It is an arithmetic number, because the mean of its divisors is an integer number (2262053843937).
Almost surely, 212002100120022 is an apocalyptic number.
12002100120022 is a deficient number, since it is larger than the sum of its proper divisors (6094330631474).
12002100120022 is a wasteful number, since it uses less digits than its factorization.
12002100120022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31093523822.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 12002100120022 its reverse (22002100120021), we get a palindrome (34004200240043).
Subtracting 12002100120022 from its reverse (22002100120021), we obtain a palindrome (9999999999999).
The spelling of 12002100120022 in words is "twelve trillion, two billion, one hundred million, one hundred twenty thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •