Base | Representation |
---|---|
bin | 1001011000111000001011… |
… | …0100100100011100010001 |
3 | 1100112212110201000212221102 |
4 | 2112032002310210130101 |
5 | 2323113001303343441 |
6 | 33542153222234145 |
7 | 2113545410454545 |
oct | 226160264443421 |
9 | 40485421025842 |
10 | 10323001231121 |
11 | 331aa62090737 |
12 | 11a8800285955 |
13 | 59b5bb387757 |
14 | 2798c8d9da25 |
15 | 12d7d1aa669b |
hex | 96382d24711 |
10323001231121 has 2 divisors, whose sum is σ = 10323001231122. Its totient is φ = 10323001231120.
The previous prime is 10323001231087. The next prime is 10323001231133. The reversal of 10323001231121 is 12113210032301.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9493399050496 + 829602180625 = 3081136^2 + 910825^2 .
It is a cyclic number.
It is not a de Polignac number, because 10323001231121 - 26 = 10323001231057 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10323001231093 and 10323001231102.
It is not a weakly prime, because it can be changed into another prime (10323001231321) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5161500615560 + 5161500615561.
It is an arithmetic number, because the mean of its divisors is an integer number (5161500615561).
Almost surely, 210323001231121 is an apocalyptic number.
It is an amenable number.
10323001231121 is a deficient number, since it is larger than the sum of its proper divisors (1).
10323001231121 is an equidigital number, since it uses as much as digits as its factorization.
10323001231121 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 10323001231121 its reverse (12113210032301), we get a palindrome (22436211263422).
The spelling of 10323001231121 in words is "ten trillion, three hundred twenty-three billion, one million, two hundred thirty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •