Base | Representation |
---|---|
bin | 11000001111000010… |
… | …11100100100111000 |
3 | 1020120202200212210101 |
4 | 30013201130210320 |
5 | 203121321011300 |
6 | 5551025125144 |
7 | 640266416614 |
oct | 140741344470 |
9 | 36522625711 |
10 | 13011110200 |
11 | 5577483740 |
12 | 26314897b4 |
13 | 12c479199a |
14 | 8b601c344 |
15 | 5123e8b6a |
hex | 30785c938 |
13011110200 has 48 divisors (see below), whose sum is σ = 33000912360. Its totient is φ = 4731312000.
The previous prime is 13011110197. The next prime is 13011110207. The reversal of 13011110200 is 201111031.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13011110207) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2954871 + ... + 2959270.
Almost surely, 213011110200 is an apocalyptic number.
13011110200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13011110200 is an abundant number, since it is smaller than the sum of its proper divisors (19989802160).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13011110200 is a wasteful number, since it uses less digits than its factorization.
13011110200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5914168 (or 5914159 counting only the distinct ones).
The product of its (nonzero) digits is 6, while the sum is 10.
Adding to 13011110200 its reverse (201111031), we get a palindrome (13212221231).
The spelling of 13011110200 in words is "thirteen billion, eleven million, one hundred ten thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •