Base | Representation |
---|---|
bin | 1001000111111101010100… |
… | …0011100100110000100001 |
3 | 1022112002011211212212221221 |
4 | 2101333111003210300201 |
5 | 2303332144204321121 |
6 | 33200441405415041 |
7 | 2053545214340236 |
oct | 221772503446041 |
9 | 38462154785857 |
10 | 10032323120161 |
11 | 321875894a671 |
12 | 11603b886a481 |
13 | 57a0758cc124 |
14 | 2697d1d0378d |
15 | 125e6c9a8b41 |
hex | 91fd50e4c21 |
10032323120161 has 2 divisors, whose sum is σ = 10032323120162. Its totient is φ = 10032323120160.
The previous prime is 10032323120093. The next prime is 10032323120173. The reversal of 10032323120161 is 16102132323001.
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., 9871567029025 + 160756091136 = 3141905^2 + 400944^2 .
It is a cyclic number.
It is not a de Polignac number, because 10032323120161 - 221 = 10032321023009 is a prime.
It is a super-3 number, since 3×100323231201613 (a number of 40 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (10032323123161) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5016161560080 + 5016161560081.
It is an arithmetic number, because the mean of its divisors is an integer number (5016161560081).
Almost surely, 210032323120161 is an apocalyptic number.
It is an amenable number.
10032323120161 is a deficient number, since it is larger than the sum of its proper divisors (1).
10032323120161 is an equidigital number, since it uses as much as digits as its factorization.
10032323120161 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1296, while the sum is 25.
Adding to 10032323120161 its reverse (16102132323001), we get a palindrome (26134455443162).
The spelling of 10032323120161 in words is "ten trillion, thirty-two billion, three hundred twenty-three million, one hundred twenty thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •