Base | Representation |
---|---|
bin | 11011010010100010100011… |
… | …101111110001101101001101 |
3 | 120201221220222200120101020221 |
4 | 123102202203233301231031 |
5 | 111212412122203024442 |
6 | 1103133010303311341 |
7 | 34165153013410402 |
oct | 3322424357615515 |
9 | 521856880511227 |
10 | 120021313329997 |
11 | 35273831475522 |
12 | 11564b26bab551 |
13 | 51c7c65c28a41 |
14 | 218d0c39462a9 |
15 | dd206a846467 |
hex | 6d28a3bf1b4d |
120021313329997 has 2 divisors, whose sum is σ = 120021313329998. Its totient is φ = 120021313329996.
The previous prime is 120021313329991. The next prime is 120021313330073. The reversal of 120021313329997 is 799923313120021.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 113309659379401 + 6711653950596 = 10644701^2 + 2590686^2 .
It is a cyclic number.
It is not a de Polignac number, because 120021313329997 - 23 = 120021313329989 is a prime.
It is a super-2 number, since 2×1200213133299972 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (120021313329991) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60010656664998 + 60010656664999.
It is an arithmetic number, because the mean of its divisors is an integer number (60010656664999).
Almost surely, 2120021313329997 is an apocalyptic number.
It is an amenable number.
120021313329997 is a deficient number, since it is larger than the sum of its proper divisors (1).
120021313329997 is an equidigital number, since it uses as much as digits as its factorization.
120021313329997 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1102248, while the sum is 52.
The spelling of 120021313329997 in words is "one hundred twenty trillion, twenty-one billion, three hundred thirteen million, three hundred twenty-nine thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •