Base | Representation |
---|---|
bin | 110111111000011001… |
… | …1011001001000011101 |
3 | 102110202021220222121102 |
4 | 1233300303121020131 |
5 | 3431232023333432 |
6 | 131043520442445 |
7 | 11445546125216 |
oct | 1576063311035 |
9 | 373667828542 |
10 | 120004121117 |
11 | 4699121a401 |
12 | 1b311179425 |
13 | b415ccb0ba |
14 | 5b45ada40d |
15 | 31c551b962 |
hex | 1bf0cd921d |
120004121117 has 2 divisors, whose sum is σ = 120004121118. Its totient is φ = 120004121116.
The previous prime is 120004121101. The next prime is 120004121137. The reversal of 120004121117 is 711121400021.
It is an a-pointer prime, because the next prime (120004121137) can be obtained adding 120004121117 to its sum of digits (20).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 119366104036 + 638017081 = 345494^2 + 25259^2 .
It is an emirp because it is prime and its reverse (711121400021) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 120004121117 - 24 = 120004121101 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (120004121137) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60002060558 + 60002060559.
It is an arithmetic number, because the mean of its divisors is an integer number (60002060559).
Almost surely, 2120004121117 is an apocalyptic number.
It is an amenable number.
120004121117 is a deficient number, since it is larger than the sum of its proper divisors (1).
120004121117 is an equidigital number, since it uses as much as digits as its factorization.
120004121117 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 112, while the sum is 20.
Adding to 120004121117 its reverse (711121400021), we get a palindrome (831125521138).
The spelling of 120004121117 in words is "one hundred twenty billion, four million, one hundred twenty-one thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •