Base | Representation |
---|---|
bin | 10010101110101100… |
… | …110001000011101000 |
3 | 1220220120002112012102 |
4 | 102232230301003220 |
5 | 312141333340130 |
6 | 13123325032532 |
7 | 1311236214464 |
oct | 225654610350 |
9 | 56816075172 |
10 | 20110840040 |
11 | 8590054865 |
12 | 3a930b5748 |
13 | 1b86645465 |
14 | d8acd94a4 |
15 | 7ca862645 |
hex | 4aeb310e8 |
20110840040 has 32 divisors (see below), whose sum is σ = 45261576360. Its totient is φ = 8042169600.
The previous prime is 20110840039. The next prime is 20110840049. The reversal of 20110840040 is 4004801102.
It can be written as a sum of positive squares in 4 ways, for example, as 17175150916 + 2935689124 = 131054^2 + 54182^2 .
It is a super-2 number, since 2×201108400402 (a number of 21 digits) contains 22 as substring.
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 = 20110839994 and 20110840021.
It is not an unprimeable number, because it can be changed into a prime (20110840049) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 87050 + ... + 218630.
Almost surely, 220110840040 is an apocalyptic number.
20110840040 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
20110840040 is an abundant number, since it is smaller than the sum of its proper divisors (25150736320).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20110840040 is a wasteful number, since it uses less digits than its factorization.
20110840040 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 135413 (or 135409 counting only the distinct ones).
The product of its (nonzero) digits is 256, while the sum is 20.
The spelling of 20110840040 in words is "twenty billion, one hundred ten million, eight hundred forty thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •