Base | Representation |
---|---|
bin | 11110000000011100100… |
… | …11110101100010111000 |
3 | 10122120021102001011010102 |
4 | 33000032103311202320 |
5 | 113343023222411440 |
6 | 2105352154534532 |
7 | 134326640241662 |
oct | 17001623654270 |
9 | 3576242034112 |
10 | 1031032232120 |
11 | 3682928a8220 |
12 | 1479a2737448 |
13 | 762c2474a77 |
14 | 37c8b9cd532 |
15 | 1bc45cdbb15 |
hex | f00e4f58b8 |
1031032232120 has 64 divisors (see below), whose sum is σ = 2530891167840. Its totient is φ = 374894784000.
The previous prime is 1031032232063. The next prime is 1031032232149. The reversal of 1031032232120 is 212322301301.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a junction number, because it is equal to n+sod(n) for n = 1031032232092 and 1031032232101.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 6954770 + ... + 7101470.
Almost surely, 21031032232120 is an apocalyptic number.
1031032232120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1031032232120 is an abundant number, since it is smaller than the sum of its proper divisors (1499858935720).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1031032232120 is a wasteful number, since it uses less digits than its factorization.
1031032232120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 162696 (or 162692 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 1031032232120 its reverse (212322301301), we get a palindrome (1243354533421).
The spelling of 1031032232120 in words is "one trillion, thirty-one billion, thirty-two million, two hundred thirty-two thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •