Base | Representation |
---|---|
bin | 10110111011011110… |
… | …10100001111110111 |
3 | 1011202220122000201220 |
4 | 23131233110033313 |
5 | 200202341244111 |
6 | 5353304121423 |
7 | 614025102132 |
oct | 133557241767 |
9 | 34686560656 |
10 | 12310103031 |
11 | 5247806676 |
12 | 2476766273 |
13 | 121248c045 |
14 | 84aca1219 |
15 | 4c0ac7e06 |
hex | 2ddbd43f7 |
12310103031 has 8 divisors (see below), whose sum is σ = 16621236480. Its totient is φ = 8102852472.
The previous prime is 12310103023. The next prime is 12310103107. The reversal of 12310103031 is 13030101321.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 12310103031 - 23 = 12310103023 is a prime.
It is a super-2 number, since 2×123101030312 (a number of 21 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 12310103031.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12310103431) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 25970445 + ... + 25970918.
It is an arithmetic number, because the mean of its divisors is an integer number (2077654560).
Almost surely, 212310103031 is an apocalyptic number.
12310103031 is a deficient number, since it is larger than the sum of its proper divisors (4311133449).
12310103031 is an equidigital number, since it uses as much as digits as its factorization.
12310103031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 51941445.
The product of its (nonzero) digits is 54, while the sum is 15.
Adding to 12310103031 its reverse (13030101321), we get a palindrome (25340204352).
The spelling of 12310103031 in words is "twelve billion, three hundred ten million, one hundred three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.139 sec. • engine limits •