Base | Representation |
---|---|
bin | 10010101110101001… |
… | …100011111110101000 |
3 | 1220220111111211221022 |
4 | 102232221203332220 |
5 | 312141130000130 |
6 | 13123255032012 |
7 | 1311226115504 |
oct | 225651437650 |
9 | 56814454838 |
10 | 20110000040 |
11 | 858a630749 |
12 | 3a9296b608 |
13 | 1b86410010 |
14 | d8ab5b304 |
15 | 7ca7487e5 |
hex | 4aea63fa8 |
20110000040 has 32 divisors (see below), whose sum is σ = 48728078280. Its totient is φ = 7425230592.
The previous prime is 20110000003. The next prime is 20110000061. The reversal of 20110000040 is 4000001102.
It can be written as a sum of positive squares in 4 ways, for example, as 10551809284 + 9558190756 = 102722^2 + 97766^2 .
It is a Harshad number since it is a multiple of its sum of digits (8).
It is a junction number, because it is equal to n+sod(n) for n = 20109999982 and 20110000027.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 19336019 + ... + 19337058.
Almost surely, 220110000040 is an apocalyptic number.
20110000040 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
20110000040 is an abundant number, since it is smaller than the sum of its proper divisors (28618078240).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20110000040 is a wasteful number, since it uses less digits than its factorization.
20110000040 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38673101 (or 38673097 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 8.
Adding to 20110000040 its reverse (4000001102), we get a palindrome (24110001142).
The spelling of 20110000040 in words is "twenty billion, one hundred ten million, forty", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •