Base | Representation |
---|---|
bin | 1001011000001000000111… |
… | …1010100110011101101001 |
3 | 1100111122011200020000022111 |
4 | 2112002001322212131221 |
5 | 2322410041342230121 |
6 | 33532221200322321 |
7 | 2112610626443524 |
oct | 226020172463551 |
9 | 40448150200274 |
10 | 10310101133161 |
11 | 3315542340155 |
12 | 11a62000133a1 |
13 | 59a3138c3aab |
14 | 2790239dbbbb |
15 | 12d2c92da2e1 |
hex | 96081ea6769 |
10310101133161 has 2 divisors, whose sum is σ = 10310101133162. Its totient is φ = 10310101133160.
The previous prime is 10310101133119. The next prime is 10310101133197. The reversal of 10310101133161 is 16133110101301.
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., 9711730813225 + 598370319936 = 3116365^2 + 773544^2 .
It is a cyclic number.
It is not a de Polignac number, because 10310101133161 - 29 = 10310101132649 is a prime.
It is a super-3 number, since 3×103101011331613 (a number of 40 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (10310101133261) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5155050566580 + 5155050566581.
It is an arithmetic number, because the mean of its divisors is an integer number (5155050566581).
Almost surely, 210310101133161 is an apocalyptic number.
It is an amenable number.
10310101133161 is a deficient number, since it is larger than the sum of its proper divisors (1).
10310101133161 is an equidigital number, since it uses as much as digits as its factorization.
10310101133161 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 162, while the sum is 22.
Adding to 10310101133161 its reverse (16133110101301), we get a palindrome (26443211234462).
The spelling of 10310101133161 in words is "ten trillion, three hundred ten billion, one hundred one million, one hundred thirty-three thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •