Base | Representation |
---|---|
bin | 10011100111011010… |
… | …111000110000111010 |
3 | 2000100212201112121010 |
4 | 103213122320300322 |
5 | 321113442014310 |
6 | 13402001254350 |
7 | 1343642623251 |
oct | 234732706072 |
9 | 60325645533 |
10 | 21062454330 |
11 | 8a2922a755 |
12 | 40b99343b6 |
13 | 1ca8840c38 |
14 | 103b44d798 |
15 | 834187320 |
hex | 4e76b8c3a |
21062454330 has 128 divisors (see below), whose sum is σ = 52273299456. Its totient is φ = 5429318400.
The previous prime is 21062454323. The next prime is 21062454379. The reversal of 21062454330 is 3345426012.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is an unprimeable number.
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 63 ways as a sum of consecutive naturals, for example, 31864200 + ... + 31864860.
It is an arithmetic number, because the mean of its divisors is an integer number (408385152).
Almost surely, 221062454330 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 21062454330, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (26136649728).
21062454330 is an abundant number, since it is smaller than the sum of its proper divisors (31210845126).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21062454330 is a wasteful number, since it uses less digits than its factorization.
21062454330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1012.
The product of its (nonzero) digits is 17280, while the sum is 30.
It can be divided in two parts, 2106 and 2454330, that added together give a triangular number (2456436 = T2216).
The spelling of 21062454330 in words is "twenty-one billion, sixty-two million, four hundred fifty-four thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •