Base | Representation |
---|---|
bin | 10011111001100110… |
… | …010000000000000000 |
3 | 2001011010120112221011 |
4 | 103321212100000000 |
5 | 322230030013401 |
6 | 13452134010304 |
7 | 1354335045544 |
oct | 237146200000 |
9 | 61133515834 |
10 | 21367422976 |
11 | 9075398159 |
12 | 4183aa6994 |
13 | 2026a8b463 |
14 | 1069b57a24 |
15 | 850d28451 |
hex | 4f9990000 |
21367422976 has 51 divisors (see below), whose sum is σ = 42809492523. Its totient is φ = 10665000960.
The previous prime is 21367422911. The next prime is 21367422977. The reversal of 21367422976 is 67922476312.
The square root of 21367422976 is 146176.
It is a perfect power (a square), and thus also a powerful number.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (21367422977) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 2 ways as a sum of consecutive naturals, for example, 37420771 + ... + 37421341.
Almost surely, 221367422976 is an apocalyptic number.
21367422976 is the 146176-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 21367422976
21367422976 is an abundant number, since it is smaller than the sum of its proper divisors (21442069547).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21367422976 is an frugal number, since it uses more digits than its factorization.
21367422976 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1174 (or 573 counting only the distinct ones).
The product of its digits is 1524096, while the sum is 49.
Multiplying 21367422976 by its sum of digits (49), we get a square (1047003725824 = 10232322).
The spelling of 21367422976 in words is "twenty-one billion, three hundred sixty-seven million, four hundred twenty-two thousand, nine hundred seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •