Base | Representation |
---|---|
bin | 11101000000010001… |
… | …001100101001001100 |
3 | 2222101102002101121010 |
4 | 131000101030221030 |
5 | 1002240103134012 |
6 | 22150143005220 |
7 | 2151516211656 |
oct | 350021145114 |
9 | 88342071533 |
10 | 31143021132 |
11 | 122314727a3 |
12 | 6051899810 |
13 | 2c24129772 |
14 | 17161856d6 |
15 | c2415bc3c |
hex | 74044ca4c |
31143021132 has 12 divisors (see below), whose sum is σ = 72667049336. Its totient is φ = 10381007040.
The previous prime is 31143021097. The next prime is 31143021139. The reversal of 31143021132 is 23112034113.
It is a tau number, because it is divible by the number of its divisors (12).
It is a super-2 number, since 2×311430211322 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 31143021099 and 31143021108.
It is not an unprimeable number, because it can be changed into a prime (31143021139) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1297625869 + ... + 1297625892.
Almost surely, 231143021132 is an apocalyptic number.
It is an amenable number.
31143021132 is an abundant number, since it is smaller than the sum of its proper divisors (41524028204).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
31143021132 is a wasteful number, since it uses less digits than its factorization.
31143021132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2595251768 (or 2595251766 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 31143021132 its reverse (23112034113), we get a palindrome (54255055245).
The spelling of 31143021132 in words is "thirty-one billion, one hundred forty-three million, twenty-one thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •