Base | Representation |
---|---|
bin | 11011010010100001011100… |
… | …101111010010110010011101 |
3 | 120201221210220122220121120021 |
4 | 123102201130233102302131 |
5 | 111212402202214133041 |
6 | 1103132252145352141 |
7 | 34165111336430365 |
oct | 3322413457226235 |
9 | 521853818817507 |
10 | 120020122021021 |
11 | 3527327aa65452 |
12 | 11564854038651 |
13 | 51c7b061883a1 |
14 | 218d00d6399a5 |
15 | dd1eeae75cd1 |
hex | 6d285cbd2c9d |
120020122021021 has 16 divisors (see below), whose sum is σ = 126826103808000. Its totient is φ = 113346505320048.
The previous prime is 120020122020979. The next prime is 120020122021049. The reversal of 120020122021021 is 120120221020021.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 120020122021021 - 227 = 120019987803293 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 120020122020986 and 120020122021004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120020122021421) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 98967090 + ... + 100172476.
It is an arithmetic number, because the mean of its divisors is an integer number (7926631488000).
Almost surely, 2120020122021021 is an apocalyptic number.
It is an amenable number.
120020122021021 is a deficient number, since it is larger than the sum of its proper divisors (6805981786979).
120020122021021 is a wasteful number, since it uses less digits than its factorization.
120020122021021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1260288.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 120020122021021 its reverse (120120221020021), we get a palindrome (240140343041042).
The spelling of 120020122021021 in words is "one hundred twenty trillion, twenty billion, one hundred twenty-two million, twenty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •