Base | Representation |
---|---|
bin | 1001100111001000001011… |
… | …00000110000011001101000 |
3 | 2202211112202011010211220021 |
4 | 10303210011200300121220 |
5 | 10232241230343132202 |
6 | 112541323420010224 |
7 | 4310666346223633 |
oct | 463440540603150 |
9 | 82745664124807 |
10 | 21135626536552 |
11 | 68096291a2270 |
12 | 2454286690974 |
13 | ba410903cc68 |
14 | 530d81124c1a |
15 | 269bbd3c7a37 |
hex | 133905830668 |
21135626536552 has 32 divisors (see below), whose sum is σ = 43232447973600. Its totient is φ = 9606995281600.
The previous prime is 21135626536499. The next prime is 21135626536567. The reversal of 21135626536552 is 25563562653112.
It is a self number, because there is not a number n which added to its sum of digits gives 21135626536552.
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, 6829599 + ... + 9429457.
It is an arithmetic number, because the mean of its divisors is an integer number (1351013999175).
Almost surely, 221135626536552 is an apocalyptic number.
21135626536552 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
21135626536552 is an abundant number, since it is smaller than the sum of its proper divisors (22096821437048).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21135626536552 is a wasteful number, since it uses less digits than its factorization.
21135626536552 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2692257 (or 2692253 counting only the distinct ones).
The product of its digits is 9720000, while the sum is 52.
The spelling of 21135626536552 in words is "twenty-one trillion, one hundred thirty-five billion, six hundred twenty-six million, five hundred thirty-six thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •