Base | Representation |
---|---|
bin | 11101001010100110001… |
… | …00001111100010101001 |
3 | 10112210122112110110001102 |
4 | 32211103010033202221 |
5 | 112404320434014004 |
6 | 2044211254531145 |
7 | 132254330651543 |
oct | 16452304174251 |
9 | 3483575413042 |
10 | 1002121001129 |
11 | 356aa71a8496 |
12 | 142274366ab5 |
13 | 7366582a6b1 |
14 | 36707ddc693 |
15 | 1b102a7b11e |
hex | e95310f8a9 |
1002121001129 has 2 divisors, whose sum is σ = 1002121001130. Its totient is φ = 1002121001128.
The previous prime is 1002121001053. The next prime is 1002121001239. The reversal of 1002121001129 is 9211001212001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 998554522729 + 3566478400 = 999277^2 + 59720^2 .
It is an emirp because it is prime and its reverse (9211001212001) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1002121001129 - 220 = 1002119952553 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1002121001129.
It is not a weakly prime, because it can be changed into another prime (1002121001729) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 501060500564 + 501060500565.
It is an arithmetic number, because the mean of its divisors is an integer number (501060500565).
Almost surely, 21002121001129 is an apocalyptic number.
It is an amenable number.
1002121001129 is a deficient number, since it is larger than the sum of its proper divisors (1).
1002121001129 is an equidigital number, since it uses as much as digits as its factorization.
1002121001129 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 20.
The spelling of 1002121001129 in words is "one trillion, two billion, one hundred twenty-one million, one thousand, one hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •