Base | Representation |
---|---|
bin | 10010101010001000… |
… | …001100010001000100 |
3 | 1220201012202221001102 |
4 | 102222020030101010 |
5 | 312012220041200 |
6 | 13111545115232 |
7 | 1306315260023 |
oct | 225210142104 |
9 | 56635687042 |
10 | 20034143300 |
11 | 855082a426 |
12 | 3a71488b18 |
13 | 1b737a0782 |
14 | d80a528ba |
15 | 7c3c626d5 |
hex | 4aa20c444 |
20034143300 has 18 divisors (see below), whose sum is σ = 43474091178. Its totient is φ = 8013657280.
The previous prime is 20034143299. The next prime is 20034143303. The reversal of 20034143300 is 334143002.
It can be written as a sum of positive squares in 3 ways, for example, as 794788864 + 19239354436 = 28192^2 + 138706^2 .
It is a Harshad number since it is a multiple of its sum of digits (20).
It is not an unprimeable number, because it can be changed into a prime (20034143303) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 100170617 + ... + 100170816.
Almost surely, 220034143300 is an apocalyptic number.
20034143300 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
20034143300 is an abundant number, since it is smaller than the sum of its proper divisors (23439947878).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20034143300 is a wasteful number, since it uses less digits than its factorization.
20034143300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 200341447 (or 200341440 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 20.
Adding to 20034143300 its reverse (334143002), we get a palindrome (20368286302).
The spelling of 20034143300 in words is "twenty billion, thirty-four million, one hundred forty-three thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •