Base | Representation |
---|---|
bin | 1001011000111000001101… |
… | …1010010101101010000001 |
3 | 1100112212111101122220102212 |
4 | 2112032003122111222001 |
5 | 2323113011322211113 |
6 | 33542154214351505 |
7 | 2113545560562305 |
oct | 226160332255201 |
9 | 40485441586385 |
10 | 10323011132033 |
11 | 331aa67733406 |
12 | 11a880365b595 |
13 | 59b5c0443192 |
14 | 2798ca419d05 |
15 | 12d7d28b00a8 |
hex | 96383695a81 |
10323011132033 has 2 divisors, whose sum is σ = 10323011132034. Its totient is φ = 10323011132032.
The previous prime is 10323011131999. The next prime is 10323011132053. The reversal of 10323011132033 is 33023111032301.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8656970406529 + 1666040725504 = 2942273^2 + 1290752^2 .
It is a cyclic number.
It is not a de Polignac number, because 10323011132033 - 212 = 10323011127937 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (10323011132053) 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, 5161505566016 + 5161505566017.
It is an arithmetic number, because the mean of its divisors is an integer number (5161505566017).
Almost surely, 210323011132033 is an apocalyptic number.
It is an amenable number.
10323011132033 is a deficient number, since it is larger than the sum of its proper divisors (1).
10323011132033 is an equidigital number, since it uses as much as digits as its factorization.
10323011132033 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 972, while the sum is 23.
Adding to 10323011132033 its reverse (33023111032301), we get a palindrome (43346122164334).
The spelling of 10323011132033 in words is "ten trillion, three hundred twenty-three billion, eleven million, one hundred thirty-two thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •