Base | Representation |
---|---|
bin | 11000111001001011… |
… | …01110011110110010 |
3 | 1021111101202200001112 |
4 | 30130211232132302 |
5 | 204332311204100 |
6 | 10050052433322 |
7 | 652120555160 |
oct | 143445563662 |
9 | 37441680045 |
10 | 13364553650 |
11 | 5738a3aa68 |
12 | 270b918842 |
13 | 134ca82316 |
14 | 90ad44230 |
15 | 533462b35 |
hex | 31c96e7b2 |
13364553650 has 192 divisors, whose sum is σ = 30598041600. Its totient is φ = 4244486400.
The previous prime is 13364553649. The next prime is 13364553667. The reversal of 13364553650 is 5635546331.
It is a super-2 number, since 2×133645536502 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 13364553598 and 13364553607.
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 95 ways as a sum of consecutive naturals, for example, 38293676 + ... + 38294024.
It is an arithmetic number, because the mean of its divisors is an integer number (159364800).
Almost surely, 213364553650 is an apocalyptic number.
13364553650 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13364553650 is an abundant number, since it is smaller than the sum of its proper divisors (17233487950).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13364553650 is a wasteful number, since it uses less digits than its factorization.
13364553650 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 529 (or 524 counting only the distinct ones).
The product of its (nonzero) digits is 486000, while the sum is 41.
The spelling of 13364553650 in words is "thirteen billion, three hundred sixty-four million, five hundred fifty-three thousand, six hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •