Base | Representation |
---|---|
bin | 1110001100001010001101… |
… | …01111110011001100010100 |
3 | 11002111002022002002002201101 |
4 | 13012011012233303030110 |
5 | 13042222021312403022 |
6 | 150210550554435444 |
7 | 6400265201410120 |
oct | 706050657631424 |
9 | 132432262062641 |
10 | 31204124341012 |
11 | 9a4065a778637 |
12 | 35bb69a132b84 |
13 | 14546c833240c |
14 | 79c405554580 |
15 | 391a56aeb627 |
hex | 1c6146bf3314 |
31204124341012 has 12 divisors (see below), whose sum is σ = 62408248682080. Its totient is φ = 13373196146136.
The previous prime is 31204124340971. The next prime is 31204124341021. The reversal of 31204124341012 is 21014342140213.
It is a happy number.
31204124341012 is an admirable number.
It is a Harshad number since it is a multiple of its sum of digits (28), and also a Moran number because the ratio is a prime number: 1114433012179 = 31204124341012 / (3 + 1 + 2 + 0 + 4 + 1 + 2 + 4 + 3 + 4 + 1 + 0 + 1 + 2).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 557216506062 + ... + 557216506117.
Almost surely, 231204124341012 is an apocalyptic number.
It is an amenable number.
31204124341012 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
31204124341012 is a wasteful number, since it uses less digits than its factorization.
31204124341012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1114433012190 (or 1114433012188 counting only the distinct ones).
The product of its (nonzero) digits is 4608, while the sum is 28.
Adding to 31204124341012 its reverse (21014342140213), we get a palindrome (52218466481225).
The spelling of 31204124341012 in words is "thirty-one trillion, two hundred four billion, one hundred twenty-four million, three hundred forty-one thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •