Base | Representation |
---|---|
bin | 11000110101110010… |
… | …10011001111000100 |
3 | 1021102102021121211021 |
4 | 30122321103033010 |
5 | 204303022134000 |
6 | 10043155320524 |
7 | 651324144640 |
oct | 143271231704 |
9 | 37372247737 |
10 | 13336130500 |
11 | 5723997260 |
12 | 27022b0144 |
13 | 1346c0cca4 |
14 | 907265c20 |
15 | 530beb11a |
hex | 31ae533c4 |
13336130500 has 96 divisors (see below), whose sum is σ = 36313175808. Its totient is φ = 4156704000.
The previous prime is 13336130497. The next prime is 13336130519. The reversal of 13336130500 is 503163331.
13336130500 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (25).
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 31 ways as a sum of consecutive naturals, for example, 134697 + ... + 211696.
It is an arithmetic number, because the mean of its divisors is an integer number (378262248).
Almost surely, 213336130500 is an apocalyptic number.
13336130500 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13336130500 is an abundant number, since it is smaller than the sum of its proper divisors (22977045308).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13336130500 is a wasteful number, since it uses less digits than its factorization.
13336130500 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 346430 (or 346418 counting only the distinct ones).
The product of its (nonzero) digits is 2430, while the sum is 25.
Adding to 13336130500 its reverse (503163331), we get a palindrome (13839293831).
The spelling of 13336130500 in words is "thirteen billion, three hundred thirty-six million, one hundred thirty thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •