Base | Representation |
---|---|
bin | 10011001101010100… |
… | …10100001000011011 |
3 | 222121200102021111000 |
4 | 21212222110020123 |
5 | 132104422200011 |
6 | 4423140240043 |
7 | 513356062464 |
oct | 114652241033 |
9 | 28550367430 |
10 | 10312303131 |
11 | 4412031a79 |
12 | 1bb96a0023 |
13 | c84605220 |
14 | 6db819d6b |
15 | 4054ec356 |
hex | 266a9421b |
10312303131 has 16 divisors (see below), whose sum is σ = 16452677920. Its totient is φ = 6346032480.
The previous prime is 10312303103. The next prime is 10312303147. The reversal of 10312303131 is 13130321301.
It is a happy number.
10312303131 is a `hidden beast` number, since 10 + 312 + 30 + 313 + 1 = 666.
10312303131 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 10312303131 - 29 = 10312302619 is a prime.
It is a super-2 number, since 2×103123031312 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10312303151) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 14689540 + ... + 14690241.
It is an arithmetic number, because the mean of its divisors is an integer number (1028292370).
Almost surely, 210312303131 is an apocalyptic number.
10312303131 is a deficient number, since it is larger than the sum of its proper divisors (6140374789).
10312303131 is a wasteful number, since it uses less digits than its factorization.
10312303131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29379803 (or 29379797 counting only the distinct ones).
The product of its (nonzero) digits is 162, while the sum is 18.
Adding to 10312303131 its reverse (13130321301), we get a palindrome (23442624432).
The spelling of 10312303131 in words is "ten billion, three hundred twelve million, three hundred three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •