Base | Representation |
---|---|
bin | 1001001011111001011111… |
… | …01011000100100100000000 |
3 | 2122112002210220002211011020 |
4 | 10211330233223010210000 |
5 | 10121424130414404440 |
6 | 110543433252545440 |
7 | 4153255412414100 |
oct | 445745753044400 |
9 | 78462726084136 |
10 | 20200031013120 |
11 | 648886a990912 |
12 | 2322a99622280 |
13 | b36b15b7106a |
14 | 4db9884d3200 |
15 | 2506b0dd43d0 |
hex | 125f2fac4900 |
20200031013120 has 216 divisors, whose sum is σ = 75046723061184. Its totient is φ = 4617149902848.
The previous prime is 20200031013061. The next prime is 20200031013139. The reversal of 20200031013120 is 2131013000202.
It is a super-2 number, since 2×202000310131202 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 20200031013120.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 53489644 + ... + 53865963.
Almost surely, 220200031013120 is an apocalyptic number.
20200031013120 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
20200031013120 is an abundant number, since it is smaller than the sum of its proper divisors (54846692048064).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20200031013120 is a wasteful number, since it uses less digits than its factorization.
20200031013120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 107355645 (or 107355624 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 20200031013120 its reverse (2131013000202), we get a palindrome (22331044013322).
The spelling of 20200031013120 in words is "twenty trillion, two hundred billion, thirty-one million, thirteen thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •