Base | Representation |
---|---|
bin | 111001010010100111… |
… | …0110110111110011001 |
3 | 102202120020221112210100 |
4 | 1302211032312332121 |
5 | 4003431443020441 |
6 | 132304134010013 |
7 | 11613554054565 |
oct | 1624516667631 |
9 | 382506845710 |
10 | 123031220121 |
11 | 481a4a09717 |
12 | 1ba16aa6909 |
13 | b7a91b0044 |
14 | 5d51b586a5 |
15 | 3301164cb6 |
hex | 1ca53b6f99 |
123031220121 has 12 divisors (see below), whose sum is σ = 177809269248. Its totient is φ = 81975810264.
The previous prime is 123031220119. The next prime is 123031220129. The reversal of 123031220121 is 121022130321.
123031220121 is a `hidden beast` number, since 1 + 230 + 312 + 2 + 0 + 121 = 666.
It is not a de Polignac number, because 123031220121 - 21 = 123031220119 is a prime.
It is a super-2 number, since 2×1230312201212 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 123031220094 and 123031220103.
It is not an unprimeable number, because it can be changed into a prime (123031220129) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 3732945 + ... + 3765758.
It is an arithmetic number, because the mean of its divisors is an integer number (14817439104).
Almost surely, 2123031220121 is an apocalyptic number.
It is an amenable number.
123031220121 is a deficient number, since it is larger than the sum of its proper divisors (54778049127).
123031220121 is a wasteful number, since it uses less digits than its factorization.
123031220121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7500532 (or 7500529 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 123031220121 its reverse (121022130321), we get a palindrome (244053350442).
The spelling of 123031220121 in words is "one hundred twenty-three billion, thirty-one million, two hundred twenty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •