Base | Representation |
---|---|
bin | 10011110110011111… |
… | …001100010011000000 |
3 | 2001000111101102221000 |
4 | 103312133030103000 |
5 | 322123200204102 |
6 | 13443031332000 |
7 | 1353132363132 |
oct | 236637142300 |
9 | 61014342830 |
10 | 21315241152 |
11 | 9048997187 |
12 | 416a521000 |
13 | 201901ac3a |
14 | 1062c53052 |
15 | 84b46c01c |
hex | 4f67cc4c0 |
21315241152 has 112 divisors (see below), whose sum is σ = 62988525280. Its totient is φ = 7068155904.
The previous prime is 21315241147. The next prime is 21315241177. The reversal of 21315241152 is 25114251312.
It is a happy number.
21315241152 is a `hidden beast` number, since 2 + 131 + 524 + 1 + 1 + 5 + 2 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 301548 + ... + 365460.
Almost surely, 221315241152 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 21315241152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (31494262640).
21315241152 is an abundant number, since it is smaller than the sum of its proper divisors (41673284128).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21315241152 is a wasteful number, since it uses less digits than its factorization.
21315241152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 64127 (or 64111 counting only the distinct ones).
The product of its digits is 2400, while the sum is 27.
Adding to 21315241152 its reverse (25114251312), we get a palindrome (46429492464).
The spelling of 21315241152 in words is "twenty-one billion, three hundred fifteen million, two hundred forty-one thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •