Base | Representation |
---|---|
bin | 110111111110100110… |
… | …0011101110001001101 |
3 | 102111021210010100200012 |
4 | 1233331030131301031 |
5 | 3432143234122201 |
6 | 131120304443005 |
7 | 11453652212252 |
oct | 1577514356115 |
9 | 374253110605 |
10 | 120212020301 |
11 | 46a8860810a |
12 | 1b36a919465 |
13 | b44a0bc979 |
14 | 5b65577429 |
15 | 31d88d65bb |
hex | 1bfd31dc4d |
120212020301 has 2 divisors, whose sum is σ = 120212020302. Its totient is φ = 120212020300.
The previous prime is 120212020289. The next prime is 120212020333. The reversal of 120212020301 is 103020212021.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 103655022025 + 16556998276 = 321955^2 + 128674^2 .
It is a cyclic number.
It is not a de Polignac number, because 120212020301 - 218 = 120211758157 is a prime.
It is a super-2 number, since 2×1202120203012 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (120212220301) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60106010150 + 60106010151.
It is an arithmetic number, because the mean of its divisors is an integer number (60106010151).
Almost surely, 2120212020301 is an apocalyptic number.
It is an amenable number.
120212020301 is a deficient number, since it is larger than the sum of its proper divisors (1).
120212020301 is an equidigital number, since it uses as much as digits as its factorization.
120212020301 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48, while the sum is 14.
Adding to 120212020301 its reverse (103020212021), we get a palindrome (223232232322).
The spelling of 120212020301 in words is "one hundred twenty billion, two hundred twelve million, twenty thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •