Base | Representation |
---|---|
bin | 1001110001000011001110… |
… | …00010111011010000101000 |
3 | 2211001010202202120112212020 |
4 | 10320201213002323100220 |
5 | 10303333001204102024 |
6 | 113402110424544440 |
7 | 4344426211004454 |
oct | 470414702732050 |
9 | 84033682515766 |
10 | 21476565300264 |
11 | 6930184245688 |
12 | 24aa376322120 |
13 | bca30156a6b9 |
14 | 5436853a1664 |
15 | 2739c4ba5979 |
hex | 1388670bb428 |
21476565300264 has 32 divisors (see below), whose sum is σ = 53691527113440. Its totient is φ = 7158839918400.
The previous prime is 21476565300259. The next prime is 21476565300283. The reversal of 21476565300264 is 46200356567412.
It is a super-2 number, since 2×214765653002642 (a number of 27 digits) contains 22 as substring.
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 7 ways as a sum of consecutive naturals, for example, 20485974 + ... + 21508794.
It is an arithmetic number, because the mean of its divisors is an integer number (1677860222295).
Almost surely, 221476565300264 is an apocalyptic number.
21476565300264 is a gapful number since it is divisible by the number (24) formed by its first and last digit.
It is an amenable number.
21476565300264 is an abundant number, since it is smaller than the sum of its proper divisors (32214961813176).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21476565300264 is a wasteful number, since it uses less digits than its factorization.
21476565300264 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1897721 (or 1897717 counting only the distinct ones).
The product of its (nonzero) digits is 7257600, while the sum is 51.
The spelling of 21476565300264 in words is "twenty-one trillion, four hundred seventy-six billion, five hundred sixty-five million, three hundred thousand, two hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •