Base | Representation |
---|---|
bin | 11110000000101000010… |
… | …01111110101001000000 |
3 | 10122120112020121002101010 |
4 | 33000110021332221000 |
5 | 113343223324424412 |
6 | 2105410021040520 |
7 | 134332241013630 |
oct | 17002411765100 |
9 | 3576466532333 |
10 | 1031130311232 |
11 | 3683331a753a |
12 | 147a0b556140 |
13 | 76309895148 |
14 | 37c9aa406c0 |
15 | 1bc4e71233c |
hex | f01427ea40 |
1031130311232 has 112 divisors (see below), whose sum is σ = 3118199829120. Its totient is φ = 294584266752.
The previous prime is 1031130311171. The next prime is 1031130311251. The reversal of 1031130311232 is 2321130311301.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (112).
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a junction number, because it is equal to n+sod(n) for n = 1031130311199 and 1031130311208.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 21771994 + ... + 21819302.
Almost surely, 21031130311232 is an apocalyptic number.
1031130311232 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1031130311232 is an abundant number, since it is smaller than the sum of its proper divisors (2087069517888).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1031130311232 is a wasteful number, since it uses less digits than its factorization.
1031130311232 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 63548 (or 63538 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 1031130311232 its reverse (2321130311301), we get a palindrome (3352260622533).
The spelling of 1031130311232 in words is "one trillion, thirty-one billion, one hundred thirty million, three hundred eleven thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •