Base | Representation |
---|---|
bin | 10011000011001001… |
… | …110010000000000000 |
3 | 1221210110210101000000 |
4 | 103003021302000000 |
5 | 313342210143100 |
6 | 13221344000000 |
7 | 1322604023034 |
oct | 230311620000 |
9 | 57713711000 |
10 | 20453990400 |
11 | 87468207a8 |
12 | 3b6a000000 |
13 | 1c0c7709cc |
14 | dc07021c4 |
15 | 7eaa46900 |
hex | 4c3272000 |
20453990400 has 588 divisors, whose sum is σ = 76604516082. Its totient is φ = 5414584320.
The previous prime is 20453990383. The next prime is 20453990407. The reversal of 20453990400 is 409935402.
It can be written as a sum of positive squares in 3 ways, for example, as 15912308736 + 4541681664 = 126144^2 + 67392^2 .
It is a Harshad number since it is a multiple of its sum of digits (36).
It is not an unprimeable number, because it can be changed into a prime (20453990407) 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, 149299132 + ... + 149299268.
Almost surely, 220453990400 is an apocalyptic number.
20453990400 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 20453990400, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (38302258041).
20453990400 is an abundant number, since it is smaller than the sum of its proper divisors (56150525682).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20453990400 is an frugal number, since it uses more digits than its factorization.
20453990400 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 191 (or 147 counting only the distinct ones).
The product of its (nonzero) digits is 38880, while the sum is 36.
The spelling of 20453990400 in words is "twenty billion, four hundred fifty-three million, nine hundred ninety thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •