Base | Representation |
---|---|
bin | 10010101110111000… |
… | …110100100010000000 |
3 | 1220220210001001211222 |
4 | 102232320310202000 |
5 | 312143141000000 |
6 | 13123520454212 |
7 | 1311305115263 |
oct | 225670644200 |
9 | 56823031758 |
10 | 20114000000 |
11 | 85919129a6 |
12 | 3a9417a368 |
13 | 1b871b0863 |
14 | d8b4bccda |
15 | 7cac88a85 |
hex | 4aee34880 |
20114000000 has 224 divisors, whose sum is σ = 51098955300. Its totient is φ = 7884800000.
The previous prime is 20113999943. The next prime is 20114000017. The reversal of 20114000000 is 41102.
It can be written as a sum of positive squares in 14 ways, for example, as 19763861056 + 350138944 = 140584^2 + 18712^2 .
It is a Harshad number since it is a multiple of its sum of digits (8).
It is an unprimeable number.
It is a polite number, since it can be written in 27 ways as a sum of consecutive naturals, for example, 177999944 + ... + 178000056.
Almost surely, 220114000000 is an apocalyptic number.
20114000000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 20114000000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (25549477650).
20114000000 is an abundant number, since it is smaller than the sum of its proper divisors (30984955300).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20114000000 is an frugal number, since it uses more digits than its factorization.
20114000000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 246 (or 209 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 8.
Adding to 20114000000 its reverse (41102), we get a palindrome (20114041102).
The spelling of 20114000000 in words is "twenty billion, one hundred fourteen million", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •