Base | Representation |
---|---|
bin | 11011101111010111011011… |
… | …000111111001000101011100 |
3 | 120222222022001122022112121012 |
4 | 123233113123013321011130 |
5 | 111442341022403301022 |
6 | 1111251014105554352 |
7 | 34461240542131154 |
oct | 3357273307710534 |
9 | 528868048275535 |
10 | 122002222322012 |
11 | 35967940a0045a |
12 | 11824a214a59b8 |
13 | 530c9b6209986 |
14 | 221ad20b2b764 |
15 | e188577adde2 |
hex | 6ef5db1f915c |
122002222322012 has 12 divisors (see below), whose sum is σ = 213504891058200. Its totient is φ = 61000824876816.
The previous prime is 122002222322011. The next prime is 122002222322023. The reversal of 122002222322012 is 210223222200221.
It is a super-3 number, since 3×1220022223220123 (a number of 43 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122002222322011) by changing a digit.
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, 70610762 + ... + 72317937.
It is an arithmetic number, because the mean of its divisors is an integer number (17792074254850).
Almost surely, 2122002222322012 is an apocalyptic number.
It is an amenable number.
122002222322012 is a deficient number, since it is larger than the sum of its proper divisors (91502668736188).
122002222322012 is a wasteful number, since it uses less digits than its factorization.
122002222322012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 143142100 (or 143142098 counting only the distinct ones).
The product of its (nonzero) digits is 1536, while the sum is 23.
Adding to 122002222322012 its reverse (210223222200221), we get a palindrome (332225444522233).
The spelling of 122002222322012 in words is "one hundred twenty-two trillion, two billion, two hundred twenty-two million, three hundred twenty-two thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •