Base | Representation |
---|---|
bin | 10011111011001111… |
… | …000111011010000100 |
3 | 2001020001022012000111 |
4 | 103323033013122010 |
5 | 322304044203100 |
6 | 13454555122404 |
7 | 1355120521234 |
oct | 237317073204 |
9 | 61201265014 |
10 | 21394912900 |
11 | 90899637a9 |
12 | 4191143404 |
13 | 202c694a9a |
14 | 106d671cc4 |
15 | 8534586ba |
hex | 4fb3c7684 |
21394912900 has 27 divisors (see below), whose sum is σ = 46430135269. Its totient is φ = 8557380080.
The previous prime is 21394912883. The next prime is 21394912901. The reversal of 21394912900 is 921949312.
The square root of 21394912900 is 146270.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 7702168644 + 13692744256 = 87762^2 + 117016^2 .
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (21394912901) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 1455387 + ... + 1470013.
Almost surely, 221394912900 is an apocalyptic number.
21394912900 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
21394912900 is the 146270-th square number.
It is an amenable number.
21394912900 is an abundant number, since it is smaller than the sum of its proper divisors (25035222369).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21394912900 is an frugal number, since it uses more digits than its factorization.
21394912900 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29268 (or 14634 counting only the distinct ones).
The product of its (nonzero) digits is 34992, while the sum is 40.
The spelling of 21394912900 in words is "twenty-one billion, three hundred ninety-four million, nine hundred twelve thousand, nine hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •