Base | Representation |
---|---|
bin | 1001011101011110100001… |
… | …0011000000111001010101 |
3 | 1100211102102011211211020012 |
4 | 2113113220103000321111 |
5 | 2330411310324402013 |
6 | 34042341401250005 |
7 | 2122343403452123 |
oct | 227275023007125 |
9 | 40742364754205 |
10 | 10402013122133 |
11 | 3350518255916 |
12 | 11bbb91193905 |
13 | 5a5ba0886899 |
14 | 27d662804913 |
15 | 1308a84421a8 |
hex | 975e84c0e55 |
10402013122133 has 2 divisors, whose sum is σ = 10402013122134. Its totient is φ = 10402013122132.
The previous prime is 10402013122099. The next prime is 10402013122147. The reversal of 10402013122133 is 33122131020401.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8647492998244 + 1754520123889 = 2940662^2 + 1324583^2 .
It is a cyclic number.
It is not a de Polignac number, because 10402013122133 - 216 = 10402013056597 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10402013122099 and 10402013122108.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10402013121133) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5201006561066 + 5201006561067.
It is an arithmetic number, because the mean of its divisors is an integer number (5201006561067).
Almost surely, 210402013122133 is an apocalyptic number.
It is an amenable number.
10402013122133 is a deficient number, since it is larger than the sum of its proper divisors (1).
10402013122133 is an equidigital number, since it uses as much as digits as its factorization.
10402013122133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 10402013122133 its reverse (33122131020401), we get a palindrome (43524144142534).
The spelling of 10402013122133 in words is "ten trillion, four hundred two billion, thirteen million, one hundred twenty-two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •