Base | Representation |
---|---|
bin | 1001000101010111110… |
… | …11010101010011110111 |
3 | 1002211122022210122222001 |
4 | 10202223323111103313 |
5 | 20103211224244111 |
6 | 355215323520131 |
7 | 31356451046524 |
oct | 4425373252367 |
9 | 1084568718861 |
10 | 312122103031 |
11 | 110408876772 |
12 | 505a9089047 |
13 | 2358237563b |
14 | 1116d06614b |
15 | 81bb9ed1c1 |
hex | 48abed54f7 |
312122103031 has 8 divisors (see below), whose sum is σ = 327308017680. Its totient is φ = 297231060672.
The previous prime is 312122103001. The next prime is 312122103049. The reversal of 312122103031 is 130301221213.
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 312122103031 - 213 = 312122094839 is a prime.
It is a super-2 number, since 2×3121221030312 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (312122103001) 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, 73715905 + ... + 73720138.
It is an arithmetic number, because the mean of its divisors is an integer number (40913502210).
Almost surely, 2312122103031 is an apocalyptic number.
312122103031 is a deficient number, since it is larger than the sum of its proper divisors (15185914649).
312122103031 is a wasteful number, since it uses less digits than its factorization.
312122103031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 147436145.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 312122103031 its reverse (130301221213), we get a palindrome (442423324244).
The spelling of 312122103031 in words is "three hundred twelve billion, one hundred twenty-two million, one hundred three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •