Base | Representation |
---|---|
bin | 10011111000101011… |
… | …100111010100100000 |
3 | 2001010001122121220202 |
4 | 103320223213110200 |
5 | 322212111131000 |
6 | 13450424324332 |
7 | 1354060306316 |
oct | 237053472440 |
9 | 61101577822 |
10 | 21352052000 |
11 | 9067749774 |
12 | 417a9136a8 |
13 | 2023838cc6 |
14 | 1067ab60b6 |
15 | 84e7dddd5 |
hex | 4f8ae7520 |
21352052000 has 48 divisors (see below), whose sum is σ = 52462001592. Its totient is φ = 8540819200.
The previous prime is 21352051997. The next prime is 21352052023. The reversal of 21352052000 is 25025312.
It can be written as a sum of positive squares in 4 ways, for example, as 12681462544 + 8670589456 = 112612^2 + 93116^2 .
It is a super-2 number, since 2×213520520002 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (20).
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 7 ways as a sum of consecutive naturals, for example, 2665007 + ... + 2673006.
Almost surely, 221352052000 is an apocalyptic number.
21352052000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
21352052000 is an abundant number, since it is smaller than the sum of its proper divisors (31109949592).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21352052000 is an equidigital number, since it uses as much as digits as its factorization.
21352052000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5338038 (or 5338020 counting only the distinct ones).
The product of its (nonzero) digits is 600, while the sum is 20.
Adding to 21352052000 its reverse (25025312), we get a palindrome (21377077312).
The spelling of 21352052000 in words is "twenty-one billion, three hundred fifty-two million, fifty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •