Base | Representation |
---|---|
bin | 11000011010110110… |
… | …00100000010000100 |
3 | 1020211122222002101222 |
4 | 30031123010002010 |
5 | 203322141200400 |
6 | 10004522535512 |
7 | 642611004116 |
oct | 141533040204 |
9 | 36748862358 |
10 | 13110100100 |
11 | 5618345279 |
12 | 265a667598 |
13 | 130c1407a6 |
14 | 8c52293b6 |
15 | 51ae4e185 |
hex | 30d6c4084 |
13110100100 has 144 divisors (see below), whose sum is σ = 29698099200. Its totient is φ = 5020329600.
The previous prime is 13110100097. The next prime is 13110100121. The reversal of 13110100100 is 100101131.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 65879801 + ... + 65879999.
It is an arithmetic number, because the mean of its divisors is an integer number (206236800).
Almost surely, 213110100100 is an apocalyptic number.
13110100100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 13110100100, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (14849049600).
13110100100 is an abundant number, since it is smaller than the sum of its proper divisors (16587999100).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13110100100 is a wasteful number, since it uses less digits than its factorization.
13110100100 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 498 (or 491 counting only the distinct ones).
The product of its (nonzero) digits is 3, while the sum is 8.
Adding to 13110100100 its reverse (100101131), we get a palindrome (13210201231).
The spelling of 13110100100 in words is "thirteen billion, one hundred ten million, one hundred thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •