Base | Representation |
---|---|
bin | 1110000110100110100110… |
… | …11111100001001010101100 |
3 | 11001210211112002002000211211 |
4 | 13003103103133201022230 |
5 | 13031110024301211022 |
6 | 145543134543324204 |
7 | 6350426210406445 |
oct | 703232337411254 |
9 | 131724462060754 |
10 | 31013212132012 |
11 | 99776a1810310 |
12 | 358a699bb0664 |
13 | 143c6c1a20b86 |
14 | 7930943bc2cc |
15 | 38bad13e5e77 |
hex | 1c34d37e12ac |
31013212132012 has 48 divisors (see below), whose sum is σ = 59234161004928. Its totient is φ = 14090458878720.
The previous prime is 31013212131997. The next prime is 31013212132013. The reversal of 31013212132012 is 21023121231013.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is not an unprimeable number, because it can be changed into a prime (31013212132013) 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 15 ways as a sum of consecutive naturals, for example, 2010312643 + ... + 2010328069.
It is an arithmetic number, because the mean of its divisors is an integer number (1234045020936).
Almost surely, 231013212132012 is an apocalyptic number.
It is an amenable number.
31013212132012 is a deficient number, since it is larger than the sum of its proper divisors (28220948872916).
31013212132012 is a wasteful number, since it uses less digits than its factorization.
31013212132012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33406 (or 33404 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 31013212132012 its reverse (21023121231013), we get a palindrome (52036333363025).
Subtracting from 31013212132012 its reverse (21023121231013), we obtain a palindrome (9990090900999).
The spelling of 31013212132012 in words is "thirty-one trillion, thirteen billion, two hundred twelve million, one hundred thirty-two thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •