Base | Representation |
---|---|
bin | 11011010010100001011100… |
… | …000010010001101101011001 |
3 | 120201221210212211201001202220 |
4 | 123102201130002101231121 |
5 | 111212402141204020441 |
6 | 1103132251044414253 |
7 | 34165111134220416 |
oct | 3322413402215531 |
9 | 521853784631686 |
10 | 120020110220121 |
11 | 35273274335241 |
12 | 115648500a7389 |
13 | 51c7b038b5bc7 |
14 | 218d00bc4710d |
15 | dd1ee9de4466 |
hex | 6d285c091b59 |
120020110220121 has 8 divisors (see below), whose sum is σ = 165544979614080. Its totient is φ = 77254323819792.
The previous prime is 120020110220111. The next prime is 120020110220149. The reversal of 120020110220121 is 121022011020021.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 120020110220121 - 26 = 120020110220057 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 120020110220121.
It is not an unprimeable number, because it can be changed into a prime (120020110220111) 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, 689770748305 + ... + 689770748478.
It is an arithmetic number, because the mean of its divisors is an integer number (20693122451760).
Almost surely, 2120020110220121 is an apocalyptic number.
It is an amenable number.
120020110220121 is a deficient number, since it is larger than the sum of its proper divisors (45524869393959).
120020110220121 is a wasteful number, since it uses less digits than its factorization.
120020110220121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1379541496815.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 120020110220121 its reverse (121022011020021), we get a palindrome (241042121240142).
The spelling of 120020110220121 in words is "one hundred twenty trillion, twenty billion, one hundred ten million, two hundred twenty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •