Base | Representation |
---|---|
bin | 10011011000000001… |
… | …10111011110001011 |
3 | 222211221101111011212 |
4 | 21230000313132023 |
5 | 132300414214011 |
6 | 4440105043335 |
7 | 515526254312 |
oct | 115400673613 |
9 | 28757344155 |
10 | 10402101131 |
11 | 44587955a4 |
12 | 202378654b |
13 | c9a0b6236 |
14 | 709713279 |
15 | 40d33908b |
hex | 26c03778b |
10402101131 has 2 divisors, whose sum is σ = 10402101132. Its totient is φ = 10402101130.
The previous prime is 10402101113. The next prime is 10402101161. The reversal of 10402101131 is 13110120401.
10402101131 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
Together with previous prime (10402101113) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 10402101131 - 226 = 10334992267 is a prime.
It is a super-2 number, since 2×104021011312 (a number of 21 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10402101161) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5201050565 + 5201050566.
It is an arithmetic number, because the mean of its divisors is an integer number (5201050566).
Almost surely, 210402101131 is an apocalyptic number.
10402101131 is a deficient number, since it is larger than the sum of its proper divisors (1).
10402101131 is an equidigital number, since it uses as much as digits as its factorization.
10402101131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24, while the sum is 14.
Adding to 10402101131 its reverse (13110120401), we get a palindrome (23512221532).
The spelling of 10402101131 in words is "ten billion, four hundred two million, one hundred one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •