Base | Representation |
---|---|
bin | 11011010010001111101111… |
… | …000100011110001110111001 |
3 | 120201212222211010210002210012 |
4 | 123102033233010132032321 |
5 | 111212044224131204402 |
6 | 1103115424553031305 |
7 | 34163536115623262 |
oct | 3322175704361671 |
9 | 521788733702705 |
10 | 120001102209977 |
11 | 352661aa85894a |
12 | 115610263b5535 |
13 | 51c60948a2521 |
14 | 218c1275c5969 |
15 | dd17862c6452 |
hex | 6d23ef11e3b9 |
120001102209977 has 2 divisors, whose sum is σ = 120001102209978. Its totient is φ = 120001102209976.
The previous prime is 120001102209953. The next prime is 120001102209979. The reversal of 120001102209977 is 779902201100021.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 109923880522681 + 10077221687296 = 10484459^2 + 3174464^2 .
It is a cyclic number.
It is not a de Polignac number, because 120001102209977 - 218 = 120001101947833 is a prime.
Together with 120001102209979, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (120001102209979) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60000551104988 + 60000551104989.
It is an arithmetic number, because the mean of its divisors is an integer number (60000551104989).
Almost surely, 2120001102209977 is an apocalyptic number.
It is an amenable number.
120001102209977 is a deficient number, since it is larger than the sum of its proper divisors (1).
120001102209977 is an equidigital number, since it uses as much as digits as its factorization.
120001102209977 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 31752, while the sum is 41.
Adding to 120001102209977 its reverse (779902201100021), we get a palindrome (899903303309998).
The spelling of 120001102209977 in words is "one hundred twenty trillion, one billion, one hundred two million, two hundred nine thousand, nine hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •