Base | Representation |
---|---|
bin | 11110000010010001011… |
… | …01011011100110011000 |
3 | 10122122210200200112120212 |
4 | 33001020231123212120 |
5 | 113402030034120440 |
6 | 2110033315110252 |
7 | 134363135301524 |
oct | 17011055334630 |
9 | 3578720615525 |
10 | 1032012020120 |
11 | 368745976474 |
12 | 1480168a2388 |
13 | 7641a456193 |
14 | 37d41b98d84 |
15 | 1bca1d29465 |
hex | f048b5b998 |
1032012020120 has 64 divisors (see below), whose sum is σ = 2398107967200. Its totient is φ = 399403975680.
The previous prime is 1032012020119. The next prime is 1032012020129. The reversal of 1032012020120 is 210202102301.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 1032012020095 and 1032012020104.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1032012020129) by changing a digit.
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, 1682861 + ... + 2212700.
Almost surely, 21032012020120 is an apocalyptic number.
1032012020120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1032012020120 is an abundant number, since it is smaller than the sum of its proper divisors (1366095947080).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1032012020120 is a wasteful number, since it uses less digits than its factorization.
1032012020120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3895788 (or 3895784 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 14.
Adding to 1032012020120 its reverse (210202102301), we get a palindrome (1242214122421).
The spelling of 1032012020120 in words is "one trillion, thirty-two billion, twelve million, twenty thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •