Base | Representation |
---|---|
bin | 10010111010010000… |
… | …010000000000000000 |
3 | 1221102001212012000000 |
4 | 102322100100000000 |
5 | 313041000104300 |
6 | 13154452000000 |
7 | 1316112012303 |
oct | 227220200000 |
9 | 57361765000 |
10 | 20304691200 |
11 | 867a518032 |
12 | 3b28000000 |
13 | 1bb7858aa1 |
14 | da895ab3a |
15 | 7dc8a4c00 |
hex | 4ba410000 |
20304691200 has 714 divisors, whose sum is σ = 79939416474. Its totient is φ = 5096079360.
The previous prime is 20304691109. The next prime is 20304691207. The reversal of 20304691200 is 219640302.
It can be written as a sum of positive squares in 3 ways, for example, as 3057647616 + 17247043584 = 55296^2 + 131328^2 .
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (20304691207) by changing a digit.
It is a polite number, since it can be written in 41 ways as a sum of consecutive naturals, for example, 1194393592 + ... + 1194393608.
Almost surely, 220304691200 is an apocalyptic number.
20304691200 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 20304691200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (39969708237).
20304691200 is an abundant number, since it is smaller than the sum of its proper divisors (59634725274).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20304691200 is an frugal number, since it uses more digits than its factorization.
20304691200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 77 (or 27 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 27.
The spelling of 20304691200 in words is "twenty billion, three hundred four million, six hundred ninety-one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •