Base | Representation |
---|---|
bin | 1000010111111110100011… |
… | …0001100001000111001001 |
3 | 1012121021111202112101211001 |
4 | 2011333220301201013021 |
5 | 2201331011133210441 |
6 | 31330034525335001 |
7 | 1640154216245125 |
oct | 205775061410711 |
9 | 35537452471731 |
10 | 9208020210121 |
11 | 2a301103a0957 |
12 | 10486ab407461 |
13 | 51a40a979c15 |
14 | 23b956012585 |
15 | 10e7c5cde731 |
hex | 85fe8c611c9 |
9208020210121 has 2 divisors, whose sum is σ = 9208020210122. Its totient is φ = 9208020210120.
The previous prime is 9208020210119. The next prime is 9208020210163. The reversal of 9208020210121 is 1210120208029.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7703622291600 + 1504397918521 = 2775540^2 + 1226539^2 .
It is an emirp because it is prime and its reverse (1210120208029) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 9208020210121 - 21 = 9208020210119 is a prime.
Together with 9208020210119, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 9208020210121.
It is not a weakly prime, because it can be changed into another prime (9208020210721) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 4604010105060 + 4604010105061.
It is an arithmetic number, because the mean of its divisors is an integer number (4604010105061).
Almost surely, 29208020210121 is an apocalyptic number.
It is an amenable number.
9208020210121 is a deficient number, since it is larger than the sum of its proper divisors (1).
9208020210121 is an equidigital number, since it uses as much as digits as its factorization.
9208020210121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1152, while the sum is 28.
The spelling of 9208020210121 in words is "nine trillion, two hundred eight billion, twenty million, two hundred ten thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •