Base | Representation |
---|---|
bin | 1001000101001100111… |
… | …00011010100100010101 |
3 | 1002211101220201001000121 |
4 | 10202212130122210111 |
5 | 20103014202041041 |
6 | 355202240111541 |
7 | 31354253122255 |
oct | 4424634324425 |
9 | 1084356631017 |
10 | 312030112021 |
11 | 110370955541 |
12 | 505823055b1 |
13 | 235692a73a4 |
14 | 11160b5b965 |
15 | 81b38cb7d1 |
hex | 48a671a915 |
312030112021 has 8 divisors (see below), whose sum is σ = 312520978944. Its totient is φ = 311539345920.
The previous prime is 312030112013. The next prime is 312030112117. The reversal of 312030112021 is 120211030213.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 312030112021 - 23 = 312030112013 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 312030111986 and 312030112004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (312030112001) 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 in 7 ways as a sum of consecutive naturals, for example, 8287180 + ... + 8324746.
It is an arithmetic number, because the mean of its divisors is an integer number (39065122368).
Almost surely, 2312030112021 is an apocalyptic number.
It is an amenable number.
312030112021 is a deficient number, since it is larger than the sum of its proper divisors (490866923).
312030112021 is a wasteful number, since it uses less digits than its factorization.
312030112021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50411.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 312030112021 its reverse (120211030213), we get a palindrome (432241142234).
The spelling of 312030112021 in words is "three hundred twelve billion, thirty million, one hundred twelve thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •