Base | Representation |
---|---|
bin | 1010111011110010001100… |
… | …0010000011101010000010 |
3 | 1120120022101212120002100110 |
4 | 2232330203002003222002 |
5 | 3033432432002001310 |
6 | 41322531210532150 |
7 | 2350401232066563 |
oct | 256744302035202 |
9 | 46508355502313 |
10 | 12022201203330 |
11 | 391565018552a |
12 | 1421b96a37056 |
13 | 6928c512a7a6 |
14 | 2d7c4037616a |
15 | 15cad2044d20 |
hex | aef23083a82 |
12022201203330 has 32 divisors (see below), whose sum is σ = 28854487787328. Its totient is φ = 3205786443200.
The previous prime is 12022201203329. The next prime is 12022201203379. The reversal of 12022201203330 is 3330210222021.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 12022201203297 and 12022201203306.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 7635936 + ... + 9074795.
It is an arithmetic number, because the mean of its divisors is an integer number (901702743354).
Almost surely, 212022201203330 is an apocalyptic number.
12022201203330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
12022201203330 is an abundant number, since it is smaller than the sum of its proper divisors (16832286583998).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12022201203330 is a wasteful number, since it uses less digits than its factorization.
12022201203330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16734722.
The product of its (nonzero) digits is 864, while the sum is 21.
Adding to 12022201203330 its reverse (3330210222021), we get a palindrome (15352411425351).
The spelling of 12022201203330 in words is "twelve trillion, twenty-two billion, two hundred one million, two hundred three thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •