Base | Representation |
---|---|
bin | 11000110001011011… |
… | …10011100000110110 |
3 | 1021022212110210000202 |
4 | 30120231303200312 |
5 | 204214142000200 |
6 | 10035411440502 |
7 | 650401262561 |
oct | 143055634066 |
9 | 37285423022 |
10 | 13299562550 |
11 | 570529020a |
12 | 26b1bb6132 |
13 | 133c478651 |
14 | 9024674d8 |
15 | 52c8c61d5 |
hex | 318b73836 |
13299562550 has 36 divisors (see below), whose sum is σ = 25859529780. Its totient is φ = 5088518160.
The previous prime is 13299562501. The next prime is 13299562559. The reversal of 13299562550 is 5526599231.
It is a happy number.
13299562550 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Smith number, since the sum of its digits (47) coincides with the sum of the digits of its prime factors.
It is a junction number, because it is equal to n+sod(n) for n = 13299562495 and 13299562504.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13299562559) by changing a digit.
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 17 ways as a sum of consecutive naturals, for example, 224960 + ... + 277859.
Almost surely, 213299562550 is an apocalyptic number.
13299562550 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13299562550 is a deficient number, since it is larger than the sum of its proper divisors (12559967230).
13299562550 is a wasteful number, since it uses less digits than its factorization.
13299562550 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 502877 (or 502849 counting only the distinct ones).
The product of its (nonzero) digits is 729000, while the sum is 47.
The spelling of 13299562550 in words is "thirteen billion, two hundred ninety-nine million, five hundred sixty-two thousand, five hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •