Base | Representation |
---|---|
bin | 1010111010100011001101… |
… | …1101111110101111101110 |
3 | 1120111021200110202012001022 |
4 | 2232220303131332233232 |
5 | 3033111023020402342 |
6 | 41305103445014142 |
7 | 2346021006632441 |
oct | 256506335765756 |
9 | 46437613665038 |
10 | 12001002122222 |
11 | 3907661918093 |
12 | 1419a5b3b4352 |
13 | 6908c71c0a09 |
14 | 2d6bccb1d658 |
15 | 15c290dc09d2 |
hex | aea3377ebee |
12001002122222 has 8 divisors (see below), whose sum is σ = 18001529114016. Its totient is φ = 6000492417552.
The previous prime is 12001002122183. The next prime is 12001002122231. The reversal of 12001002122222 is 22222120010021.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a self number, because there is not a number n which added to its sum of digits gives 12001002122222.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2418623 + ... + 5463674.
It is an arithmetic number, because the mean of its divisors is an integer number (2250191139252).
Almost surely, 212001002122222 is an apocalyptic number.
12001002122222 is a deficient number, since it is larger than the sum of its proper divisors (6000526991794).
12001002122222 is an equidigital number, since it uses as much as digits as its factorization.
12001002122222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8643562.
The product of its (nonzero) digits is 128, while the sum is 17.
Adding to 12001002122222 its reverse (22222120010021), we get a palindrome (34223122132243).
It can be divided in two parts, 120010021 and 22222, that multiplied together give a palindrome (2666862686662).
The spelling of 12001002122222 in words is "twelve trillion, one billion, two million, one hundred twenty-two thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •