Base | Representation |
---|---|
bin | 11001000000010001… |
… | …01111100010000000 |
3 | 1021122112202010210021 |
4 | 30200020233202000 |
5 | 204443030032030 |
6 | 10100020143224 |
7 | 653442444460 |
oct | 144010574200 |
9 | 37575663707 |
10 | 13424064640 |
11 | 57695974a8 |
12 | 2727837b14 |
13 | 135c1ba81c |
14 | 914bd5ba0 |
15 | 5387ba97a |
hex | 32022f880 |
13424064640 has 64 divisors (see below), whose sum is σ = 36676474560. Its totient is φ = 4602534912.
The previous prime is 13424064629. The next prime is 13424064653. The reversal of 13424064640 is 4646042431.
It is a tau number, because it is divible by the number of its divisors (64).
It is a super-2 number, since 2×134240646402 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 13424064596 and 13424064605.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1493742 + ... + 1502701.
It is an arithmetic number, because the mean of its divisors is an integer number (573069915).
Almost surely, 213424064640 is an apocalyptic number.
13424064640 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13424064640 is an abundant number, since it is smaller than the sum of its proper divisors (23252409920).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13424064640 is an equidigital number, since it uses as much as digits as its factorization.
13424064640 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2996469 (or 2996457 counting only the distinct ones).
The product of its (nonzero) digits is 55296, while the sum is 34.
The spelling of 13424064640 in words is "thirteen billion, four hundred twenty-four million, sixty-four thousand, six hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •