Base | Representation |
---|---|
bin | 1001010011100010101011… |
… | …1110011110110001101001 |
3 | 1100020002212012022102002112 |
4 | 2110320222332132301221 |
5 | 2320112232234334004 |
6 | 33432113132412105 |
7 | 2104121654415551 |
oct | 224705276366151 |
9 | 40202765272075 |
10 | 10231333121129 |
11 | 32950a18a894a |
12 | 1192a98917035 |
13 | 592a6caa3253 |
14 | 2752b071c161 |
15 | 12b219074e6e |
hex | 94e2af9ec69 |
10231333121129 has 2 divisors, whose sum is σ = 10231333121130. Its totient is φ = 10231333121128.
The previous prime is 10231333121099. The next prime is 10231333121137. The reversal of 10231333121129 is 92112133313201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10178320361104 + 53012760025 = 3190348^2 + 230245^2 .
It is a cyclic number.
It is not a de Polignac number, because 10231333121129 - 28 = 10231333120873 is a prime.
It is a super-2 number, since 2×102313331211292 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10231333121095 and 10231333121104.
It is not a weakly prime, because it can be changed into another prime (10231333126129) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5115666560564 + 5115666560565.
It is an arithmetic number, because the mean of its divisors is an integer number (5115666560565).
Almost surely, 210231333121129 is an apocalyptic number.
It is an amenable number.
10231333121129 is a deficient number, since it is larger than the sum of its proper divisors (1).
10231333121129 is an equidigital number, since it uses as much as digits as its factorization.
10231333121129 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 5832, while the sum is 32.
The spelling of 10231333121129 in words is "ten trillion, two hundred thirty-one billion, three hundred thirty-three million, one hundred twenty-one thousand, one hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •