Base | Representation |
---|---|
bin | 11001101100100001000010… |
… | …110110101101100101011100 |
3 | 112211010200100012012201220021 |
4 | 121230201002312231211130 |
5 | 104303030044042143400 |
6 | 1040204114324201524 |
7 | 32542503420116062 |
oct | 3154410266554534 |
9 | 484120305181807 |
10 | 113010301131100 |
11 | 330104438a815a |
12 | 108121a12392a4 |
13 | 4b09a96cc43b9 |
14 | 1dc9a28d86032 |
15 | d0e9cd49871a |
hex | 66c842dad95c |
113010301131100 has 72 divisors (see below), whose sum is σ = 248348636614400. Its totient is φ = 44629746033600.
The previous prime is 113010301131071. The next prime is 113010301131107. The reversal of 113010301131100 is 1131103010311.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113010301131107) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 167229691 + ... + 167904109.
Almost surely, 2113010301131100 is an apocalyptic number.
113010301131100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
113010301131100 is an abundant number, since it is smaller than the sum of its proper divisors (135338335483300).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
113010301131100 is a wasteful number, since it uses less digits than its factorization.
113010301131100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 695723 (or 695716 counting only the distinct ones).
The product of its (nonzero) digits is 27, while the sum is 16.
Adding to 113010301131100 its reverse (1131103010311), we get a palindrome (114141404141411).
The spelling of 113010301131100 in words is "one hundred thirteen trillion, ten billion, three hundred one million, one hundred thirty-one thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •