Base | Representation |
---|---|
bin | 10010110100001001… |
… | …10000100001110001 |
3 | 222001222001122021221 |
4 | 21122010300201301 |
5 | 131141342201002 |
6 | 4350154145041 |
7 | 505213125421 |
oct | 113204604161 |
9 | 28058048257 |
10 | 10101131377 |
11 | 4313909567 |
12 | 1b5aa22181 |
13 | c4c938c1c |
14 | 6bb76a481 |
15 | 3e1bd7c37 |
hex | 25a130871 |
10101131377 has 2 divisors, whose sum is σ = 10101131378. Its totient is φ = 10101131376.
The previous prime is 10101131323. The next prime is 10101131389. The reversal of 10101131377 is 77313110101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8607386176 + 1493745201 = 92776^2 + 38649^2 .
It is a cyclic number.
It is not a de Polignac number, because 10101131377 - 231 = 7953647729 is a prime.
It is a super-2 number, since 2×101011313772 (a number of 21 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10101137377) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5050565688 + 5050565689.
It is an arithmetic number, because the mean of its divisors is an integer number (5050565689).
Almost surely, 210101131377 is an apocalyptic number.
It is an amenable number.
10101131377 is a deficient number, since it is larger than the sum of its proper divisors (1).
10101131377 is an equidigital number, since it uses as much as digits as its factorization.
10101131377 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 441, while the sum is 25.
Adding to 10101131377 its reverse (77313110101), we get a palindrome (87414241478).
The spelling of 10101131377 in words is "ten billion, one hundred one million, one hundred thirty-one thousand, three hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •