Base | Representation |
---|---|
bin | 11000011011010101… |
… | …01101000011101100 |
3 | 1020211221200101211020 |
4 | 30031222231003230 |
5 | 203324213402200 |
6 | 10005150454140 |
7 | 642660602055 |
oct | 141552550354 |
9 | 36757611736 |
10 | 13114200300 |
11 | 561a695873 |
12 | 265bb04350 |
13 | 130cc47b46 |
14 | 8c59b572c |
15 | 51b4adea0 |
hex | 30daad0ec |
13114200300 has 72 divisors (see below), whose sum is σ = 37982902272. Its totient is φ = 3493512000.
The previous prime is 13114200257. The next prime is 13114200313. The reversal of 13114200300 is 300241131.
13114200300 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 (15).
It is a self number, because there is not a number n which added to its sum of digits gives 13114200300.
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 23 ways as a sum of consecutive naturals, for example, 275245 + ... + 319355.
Almost surely, 213114200300 is an apocalyptic number.
13114200300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13114200300 is an abundant number, since it is smaller than the sum of its proper divisors (24868701972).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13114200300 is a wasteful number, since it uses less digits than its factorization.
13114200300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45119 (or 45112 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 13114200300 its reverse (300241131), we get a palindrome (13414441431).
The spelling of 13114200300 in words is "thirteen billion, one hundred fourteen million, two hundred thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.105 sec. • engine limits •