Base | Representation |
---|---|
bin | 110111111011010000… |
… | …1100001100000000101 |
3 | 102110222222112020000121 |
4 | 1233312201201200011 |
5 | 3431431111200401 |
6 | 131101225541541 |
7 | 11451123002302 |
oct | 1576641414005 |
9 | 373888466017 |
10 | 120100100101 |
11 | 46a30414883 |
12 | 1b3393448b1 |
13 | b42cb645b7 |
14 | 5b547620a9 |
15 | 31cdb79ca1 |
hex | 1bf6861805 |
120100100101 has 2 divisors, whose sum is σ = 120100100102. Its totient is φ = 120100100100.
The previous prime is 120100100077. The next prime is 120100100111. The reversal of 120100100101 is 101001001021.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 65152052001 + 54948048100 = 255249^2 + 234410^2 .
It is a cyclic number.
It is not a de Polignac number, because 120100100101 - 221 = 120098002949 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (120100100111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60050050050 + 60050050051.
It is an arithmetic number, because the mean of its divisors is an integer number (60050050051).
Almost surely, 2120100100101 is an apocalyptic number.
It is an amenable number.
120100100101 is a deficient number, since it is larger than the sum of its proper divisors (1).
120100100101 is an equidigital number, since it uses as much as digits as its factorization.
120100100101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2, while the sum is 7.
Adding to 120100100101 its reverse (101001001021), we get a palindrome (221101101122).
It can be divided in two parts, 1 and 20100100101, that added together give a palindrome (20100100102).
The spelling of 120100100101 in words is "one hundred twenty billion, one hundred million, one hundred thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •