Base | Representation |
---|---|
bin | 10011110110011011… |
… | …101110010110000000 |
3 | 2001000102200020211220 |
4 | 103312123232112000 |
5 | 322122432111112 |
6 | 13443000035040 |
7 | 1353121555500 |
oct | 236633562600 |
9 | 61012606756 |
10 | 21314332032 |
11 | 9048426144 |
12 | 416a162a80 |
13 | 2018a901b6 |
14 | 1062a97a00 |
15 | 84b33c98c |
hex | 4f66ee580 |
21314332032 has 192 divisors, whose sum is σ = 66066807600. Its totient is φ = 6070665216.
The previous prime is 21314331979. The next prime is 21314332049. The reversal of 21314332032 is 23023341312.
It is a tau number, because it is divible by the number of its divisors (192).
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a junction number, because it is equal to n+sod(n) for n = 21314331993 and 21314332011.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 6640444 + ... + 6643652.
Almost surely, 221314332032 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 21314332032, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (33033403800).
21314332032 is an abundant number, since it is smaller than the sum of its proper divisors (44752475568).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21314332032 is a wasteful number, since it uses less digits than its factorization.
21314332032 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3593 (or 3574 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 24.
Adding to 21314332032 its reverse (23023341312), we get a palindrome (44337673344).
The spelling of 21314332032 in words is "twenty-one billion, three hundred fourteen million, three hundred thirty-two thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.271 sec. • engine limits •