Base | Representation |
---|---|
bin | 10011101010100011… |
… | …010111110110000000 |
3 | 2000111112121200000102 |
4 | 103222203113312000 |
5 | 321220420313212 |
6 | 13411115541532 |
7 | 1345151425115 |
oct | 235243276600 |
9 | 60445550012 |
10 | 21115010432 |
11 | 8a5596694a |
12 | 411345a8a8 |
13 | 1cb66b2919 |
14 | 104441090c |
15 | 838ab95c2 |
hex | 4ea8d7d80 |
21115010432 has 64 divisors (see below), whose sum is σ = 44229423600. Its totient is φ = 10026240000.
The previous prime is 21115010431. The next prime is 21115010467. The reversal of 21115010432 is 23401051112.
It is a tau number, because it is divible by the number of its divisors (64).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21115010431) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 179807 + ... + 273057.
Almost surely, 221115010432 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 21115010432, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (22114711800).
21115010432 is an abundant number, since it is smaller than the sum of its proper divisors (23114413168).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21115010432 is an equidigital number, since it uses as much as digits as its factorization.
21115010432 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 93355 (or 93343 counting only the distinct ones).
The product of its (nonzero) digits is 240, while the sum is 20.
Adding to 21115010432 its reverse (23401051112), we get a palindrome (44516061544).
The spelling of 21115010432 in words is "twenty-one billion, one hundred fifteen million, ten thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •