Base | Representation |
---|---|
bin | 10010101110101010… |
… | …010101000100100000 |
3 | 1220220111220001202201 |
4 | 102232222111010200 |
5 | 312141202413440 |
6 | 13123303222544 |
7 | 1311230613652 |
oct | 225652250440 |
9 | 56814801681 |
10 | 20110201120 |
11 | 858a758829 |
12 | 3a92a47a54 |
13 | 1b864806b9 |
14 | d8abb06d2 |
15 | 7ca78819a |
hex | 4aea95120 |
20110201120 has 24 divisors (see below), whose sum is σ = 47510350524. Its totient is φ = 8044080384.
The previous prime is 20110201079. The next prime is 20110201127. The reversal of 20110201120 is 2110201102.
It can be written as a sum of positive squares in 2 ways, for example, as 19062772624 + 1047428496 = 138068^2 + 32364^2 .
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a junction number, because it is equal to n+sod(n) for n = 20110201097 and 20110201106.
It is not an unprimeable number, because it can be changed into a prime (20110201127) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 62844219 + ... + 62844538.
Almost surely, 220110201120 is an apocalyptic number.
20110201120 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
20110201120 is an abundant number, since it is smaller than the sum of its proper divisors (27400149404).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20110201120 is a wasteful number, since it uses less digits than its factorization.
20110201120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 125688772 (or 125688764 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 20110201120 its reverse (2110201102), we get a palindrome (22220402222).
The spelling of 20110201120 in words is "twenty billion, one hundred ten million, two hundred one thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •