Base | Representation |
---|---|
bin | 10010101000111000… |
… | …011111010111010000 |
3 | 1220122202110102211111 |
4 | 102220320133113100 |
5 | 311441343000000 |
6 | 13105521223104 |
7 | 1305642550432 |
oct | 225070372720 |
9 | 56582412744 |
10 | 20013250000 |
11 | 853aa59a37 |
12 | 3a66491a94 |
13 | 1b6c366883 |
14 | d7bd74652 |
15 | 7c1ed6cba |
hex | 4a8e1f5d0 |
20013250000 has 210 divisors, whose sum is σ = 51673674506. Its totient is φ = 7507200000.
The previous prime is 20013249967. The next prime is 20013250027. The reversal of 20013250000 is 5231002.
It can be written as a sum of positive squares in 21 ways, for example, as 11676099136 + 8337150864 = 108056^2 + 91308^2 .
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 41 ways as a sum of consecutive naturals, for example, 72249862 + ... + 72250138.
Almost surely, 220013250000 is an apocalyptic number.
20013250000 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 20013250000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (25836837253).
20013250000 is an abundant number, since it is smaller than the sum of its proper divisors (31660424506).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20013250000 is an frugal number, since it uses more digits than its factorization.
20013250000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 349 (or 301 counting only the distinct ones).
The product of its (nonzero) digits is 60, while the sum is 13.
Adding to 20013250000 its reverse (5231002), we get a palindrome (20018481002).
The spelling of 20013250000 in words is "twenty billion, thirteen million, two hundred fifty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •