Base | Representation |
---|---|
bin | 1001000101001100110… |
… | …11111111011110000111 |
3 | 1002211101220111101202212 |
4 | 10202212123333132013 |
5 | 20103014140013111 |
6 | 355202233454035 |
7 | 31354252150550 |
oct | 4424633773607 |
9 | 1084356441685 |
10 | 312030001031 |
11 | 11037088a111 |
12 | 5058227131b |
13 | 23569268a08 |
14 | 11160b2d327 |
15 | 81b38a898b |
hex | 48a66ff787 |
312030001031 has 16 divisors (see below), whose sum is σ = 377769090816. Its totient is φ = 251597302656.
The previous prime is 312030001007. The next prime is 312030001033. The reversal of 312030001031 is 130100030213.
It is a de Polignac number, because none of the positive numbers 2k-312030001031 is a prime.
It is a super-2 number, since 2×3120300010312 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 312030000997 and 312030001015.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (312030001033) 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 15 ways as a sum of consecutive naturals, for example, 405581 + ... + 888006.
It is an arithmetic number, because the mean of its divisors is an integer number (23610568176).
Almost surely, 2312030001031 is an apocalyptic number.
312030001031 is a deficient number, since it is larger than the sum of its proper divisors (65739089785).
312030001031 is a wasteful number, since it uses less digits than its factorization.
312030001031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1295638.
The product of its (nonzero) digits is 54, while the sum is 14.
Adding to 312030001031 its reverse (130100030213), we get a palindrome (442130031244).
The spelling of 312030001031 in words is "three hundred twelve billion, thirty million, one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •