Base | Representation |
---|---|
bin | 11011100010100011101001… |
… | …111001110101100011100101 |
3 | 120212212011001120111012202211 |
4 | 123202203221321311203211 |
5 | 111333430330003000401 |
6 | 1105334402441403421 |
7 | 34340530056630454 |
oct | 3342435171654345 |
9 | 525764046435684 |
10 | 121122002000101 |
11 | 35658609537563 |
12 | 11702309499571 |
13 | 52779a95a73cb |
14 | 21ca49c678b9b |
15 | e009db9cc951 |
hex | 6e28e9e758e5 |
121122002000101 has 2 divisors, whose sum is σ = 121122002000102. Its totient is φ = 121122002000100.
The previous prime is 121122002000099. The next prime is 121122002000107. The reversal of 121122002000101 is 101000200221121.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 121120369920900 + 1632079201 = 11005470^2 + 40399^2 .
It is a cyclic number.
It is not a de Polignac number, because 121122002000101 - 21 = 121122002000099 is a prime.
Together with 121122002000099, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (121122002000107) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60561001000050 + 60561001000051.
It is an arithmetic number, because the mean of its divisors is an integer number (60561001000051).
Almost surely, 2121122002000101 is an apocalyptic number.
It is an amenable number.
121122002000101 is a deficient number, since it is larger than the sum of its proper divisors (1).
121122002000101 is an equidigital number, since it uses as much as digits as its factorization.
121122002000101 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 121122002000101 its reverse (101000200221121), we get a palindrome (222122202221222).
The spelling of 121122002000101 in words is "one hundred twenty-one trillion, one hundred twenty-two billion, two million, one hundred one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •