Base | Representation |
---|---|
bin | 1110001100011010111111… |
… | …10001000011000011101100 |
3 | 11002111221112222101212211010 |
4 | 13012031133301003003230 |
5 | 13042343444303030012 |
6 | 150215041003425220 |
7 | 6401034362466102 |
oct | 706153761030354 |
9 | 132457488355733 |
10 | 31213134033132 |
11 | 9a44463489687 |
12 | 3601393525210 |
13 | 1455502ac709c |
14 | 79ca1bd6dc72 |
15 | 391dd2a8ec3c |
hex | 1c635fc430ec |
31213134033132 has 24 divisors (see below), whose sum is σ = 73537739731456. Its totient is φ = 10303364631888.
The previous prime is 31213134033091. The next prime is 31213134033223. The reversal of 31213134033132 is 23133043131213.
It is a happy number.
It is a super-2 number, since 2×312131340331322 (a number of 28 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 31213134033132.
It is an unprimeable number.
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, 12626671108 + ... + 12626673579.
Almost surely, 231213134033132 is an apocalyptic number.
It is an amenable number.
31213134033132 is an abundant number, since it is smaller than the sum of its proper divisors (42324605698324).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
31213134033132 is a wasteful number, since it uses less digits than its factorization.
31213134033132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25253344797 (or 25253344795 counting only the distinct ones).
The product of its (nonzero) digits is 11664, while the sum is 30.
Adding to 31213134033132 its reverse (23133043131213), we get a palindrome (54346177164345).
The spelling of 31213134033132 in words is "thirty-one trillion, two hundred thirteen billion, one hundred thirty-four million, thirty-three thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •