Base | Representation |
---|---|
bin | 111000110100001111… |
… | …0111000111001011001 |
3 | 102122221020010102020220 |
4 | 1301220132320321121 |
5 | 3444340033341441 |
6 | 132015044510253 |
7 | 11546366663646 |
oct | 1615036707131 |
9 | 378836112226 |
10 | 122012012121 |
11 | 4782166665a |
12 | 1b7916ab389 |
13 | b675ca909c |
14 | 5c9664adcd |
15 | 329193c466 |
hex | 1c687b8e59 |
122012012121 has 8 divisors (see below), whose sum is σ = 162684700320. Its totient is φ = 81340332672.
The previous prime is 122012012099. The next prime is 122012012159. The reversal of 122012012121 is 121210210221.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 122012012121 - 213 = 122012003929 is a prime.
It is a super-3 number, since 3×1220120121213 (a number of 34 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a self number, because there is not a number n which added to its sum of digits gives 122012012121.
It is not an unprimeable number, because it can be changed into a prime (122012512121) 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, 100506 + ... + 504108.
It is an arithmetic number, because the mean of its divisors is an integer number (20335587540).
Almost surely, 2122012012121 is an apocalyptic number.
It is an amenable number.
122012012121 is a deficient number, since it is larger than the sum of its proper divisors (40672688199).
122012012121 is a wasteful number, since it uses less digits than its factorization.
122012012121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 504375.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 122012012121 its reverse (121210210221), we get a palindrome (243222222342).
The spelling of 122012012121 in words is "one hundred twenty-two billion, twelve million, twelve thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •