Base | Representation |
---|---|
bin | 10100000010010101… |
… | …011100001101101100 |
3 | 2001112100102000120202 |
4 | 110002111130031230 |
5 | 323030041332000 |
6 | 13514451533032 |
7 | 1361065036412 |
oct | 240225341554 |
9 | 61470360522 |
10 | 21514011500 |
11 | 914010a2a3 |
12 | 4204bba178 |
13 | 204b264627 |
14 | 10813d52b2 |
15 | 85db31dd5 |
hex | 50255c36c |
21514011500 has 48 divisors (see below), whose sum is σ = 47096090496. Its totient is φ = 8585552000.
The previous prime is 21514011481. The next prime is 21514011503. The reversal of 21514011500 is 511041512.
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 (21514011503) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 165584 + ... + 265416.
It is an arithmetic number, because the mean of its divisors is an integer number (981168552).
Almost surely, 221514011500 is an apocalyptic number.
21514011500 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 21514011500, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (23548045248).
21514011500 is an abundant number, since it is smaller than the sum of its proper divisors (25582078996).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21514011500 is a wasteful number, since it uses less digits than its factorization.
21514011500 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 100283 (or 100271 counting only the distinct ones).
The product of its (nonzero) digits is 200, while the sum is 20.
The spelling of 21514011500 in words is "twenty-one billion, five hundred fourteen million, eleven thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •