Base | Representation |
---|---|
bin | 1001000101101111100… |
… | …10000111000110100011 |
3 | 1002212011012002021221202 |
4 | 10202313302013012203 |
5 | 20104113134342011 |
6 | 355251151111415 |
7 | 31364414541452 |
oct | 4426762070643 |
9 | 1085135067852 |
10 | 312321012131 |
11 | 110500084057 |
12 | 5064381256b |
13 | 235b463a22b |
14 | 1118b642b99 |
15 | 81ce1de23b |
hex | 48b7c871a3 |
312321012131 has 8 divisors (see below), whose sum is σ = 330753313440. Its totient is φ = 293895430528.
The previous prime is 312321012121. The next prime is 312321012137. The reversal of 312321012131 is 131210123213.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-312321012131 is a prime.
It is a super-2 number, since 2×3123210121312 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (312321012137) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1584071 + ... + 1770288.
It is an arithmetic number, because the mean of its divisors is an integer number (41344164180).
Almost surely, 2312321012131 is an apocalyptic number.
312321012131 is a deficient number, since it is larger than the sum of its proper divisors (18432301309).
312321012131 is a wasteful number, since it uses less digits than its factorization.
312321012131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3359853.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 312321012131 its reverse (131210123213), we get a palindrome (443531135344).
The spelling of 312321012131 in words is "three hundred twelve billion, three hundred twenty-one million, twelve thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •