Base | Representation |
---|---|
bin | 101011110101011011101… |
… | …111110101101111001111 |
3 | 101122222022011020020202220 |
4 | 223311123233311233033 |
5 | 343323203200421111 |
6 | 10223500422150423 |
7 | 430426611636405 |
oct | 53653357655717 |
9 | 11588264206686 |
10 | 3012311342031 |
11 | a61572249212 |
12 | 407980b82413 |
13 | 18b0a1333b84 |
14 | a5b21ddb475 |
15 | 535554b3e06 |
hex | 2bd5bbf5bcf |
3012311342031 has 8 divisors (see below), whose sum is σ = 4017767007744. Its totient is φ = 2007531618840.
The previous prime is 3012311342023. The next prime is 3012311342057. The reversal of 3012311342031 is 1302431132103.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 3012311342031 - 23 = 3012311342023 is a prime.
It is a super-2 number, since 2×30123113420312 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 3012311341992 and 3012311342010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3012311342231) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 168975231 + ... + 168993056.
It is an arithmetic number, because the mean of its divisors is an integer number (502220875968).
Almost surely, 23012311342031 is an apocalyptic number.
3012311342031 is a deficient number, since it is larger than the sum of its proper divisors (1005455665713).
3012311342031 is a wasteful number, since it uses less digits than its factorization.
3012311342031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 337971261.
The product of its (nonzero) digits is 1296, while the sum is 24.
Adding to 3012311342031 its reverse (1302431132103), we get a palindrome (4314742474134).
The spelling of 3012311342031 in words is "three trillion, twelve billion, three hundred eleven million, three hundred forty-two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •