Base | Representation |
---|---|
bin | 11001101111010001101111… |
… | …100100111100111101001010 |
3 | 112211210211001201120110200220 |
4 | 121233101233210330331022 |
5 | 104314132130140324320 |
6 | 1040431213104410510 |
7 | 32562301162024122 |
oct | 3157215744747512 |
9 | 484724051513626 |
10 | 113200030011210 |
11 | 33083954905a1a |
12 | 10842b11016a36 |
13 | 4b219423ca62c |
14 | 1dd4ca6ccbc82 |
15 | d148d4d57e40 |
hex | 66f46f93cf4a |
113200030011210 has 64 divisors (see below), whose sum is σ = 290085092149248. Its totient is φ = 28202717277504.
The previous prime is 113200030011149. The next prime is 113200030011221. The reversal of 113200030011210 is 12110030002311.
It is a happy number.
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 113200030011210.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1907621662 + ... + 1907681001.
It is an arithmetic number, because the mean of its divisors is an integer number (4532579564832).
Almost surely, 2113200030011210 is an apocalyptic number.
113200030011210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
113200030011210 is an abundant number, since it is smaller than the sum of its proper divisors (176885062138038).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
113200030011210 is a wasteful number, since it uses less digits than its factorization.
113200030011210 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3815302739.
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 113200030011210 its reverse (12110030002311), we get a palindrome (125310060013521).
The spelling of 113200030011210 in words is "one hundred thirteen trillion, two hundred billion, thirty million, eleven thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •