Base | Representation |
---|---|
bin | 1001001011111001101000… |
… | …11000110101110001000000 |
3 | 2122112010000101221212101200 |
4 | 10211330310120311301000 |
5 | 10121424311142320000 |
6 | 110543445200301200 |
7 | 4153260363000306 |
oct | 445746430656100 |
9 | 78463011855350 |
10 | 20200110120000 |
11 | 6488900601aa8 |
12 | 2322b00011800 |
13 | b36b2937aa75 |
14 | 4db994c06276 |
15 | 2506b7d0d500 |
hex | 125f34635c40 |
20200110120000 has 210 divisors, whose sum is σ = 72351801823158. Its totient is φ = 5386695936000.
The previous prime is 20200110119953. The next prime is 20200110120007. The reversal of 20200110120000 is 2101100202.
It can be written as a sum of positive squares in 5 ways, for example, as 13468077932544 + 6732032187456 = 3669888^2 + 2594616^2 .
It is a Harshad number since it is a multiple of its sum of digits (9).
It is not an unprimeable number, because it can be changed into a prime (20200110120007) by changing a digit.
It is a polite number, since it can be written in 29 ways as a sum of consecutive naturals, for example, 27695709 + ... + 28415708.
Almost surely, 220200110120000 is an apocalyptic number.
20200110120000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
20200110120000 is an abundant number, since it is smaller than the sum of its proper divisors (52151691703158).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20200110120000 is an equidigital number, since it uses as much as digits as its factorization.
20200110120000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 56111455 (or 56111427 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 20200110120000 its reverse (2101100202), we get a palindrome (20202211220202).
The spelling of 20200110120000 in words is "twenty trillion, two hundred billion, one hundred ten million, one hundred twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •