Base | Representation |
---|---|
bin | 11011010010100010010001… |
… | …101011001000000101001001 |
3 | 120201221220012120000202202022 |
4 | 123102202101223020011021 |
5 | 111212411012042333113 |
6 | 1103132520232414225 |
7 | 34165142342234300 |
oct | 3322422153100511 |
9 | 521856176022668 |
10 | 120021010121033 |
11 | 352736962aa0aa |
12 | 11564a61547375 |
13 | 51c7c18176458 |
14 | 218d095579437 |
15 | dd204de01908 |
hex | 6d2891ac8149 |
120021010121033 has 12 divisors (see below), whose sum is σ = 145686549997440. Its totient is φ = 98402318856072.
The previous prime is 120021010121017. The next prime is 120021010121069. The reversal of 120021010121033 is 330121010120021.
It is not a de Polignac number, because 120021010121033 - 24 = 120021010121017 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (120021010121003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 53248006913 + ... + 53248009166.
It is an arithmetic number, because the mean of its divisors is an integer number (12140545833120).
Almost surely, 2120021010121033 is an apocalyptic number.
It is an amenable number.
120021010121033 is a deficient number, since it is larger than the sum of its proper divisors (25665539876407).
120021010121033 is a wasteful number, since it uses less digits than its factorization.
120021010121033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 106496016116 (or 106496016109 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 120021010121033 its reverse (330121010120021), we get a palindrome (450142020241054).
The spelling of 120021010121033 in words is "one hundred twenty trillion, twenty-one billion, ten million, one hundred twenty-one thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •