Base | Representation |
---|---|
bin | 110100101100011111… |
… | …1100010011001111100 |
3 | 101211002110122102020112 |
4 | 1221120333202121330 |
5 | 3323224010410300 |
6 | 123552550405152 |
7 | 11114156556323 |
oct | 1513077423174 |
9 | 354073572215 |
10 | 113162200700 |
11 | 43aa012631a |
12 | 19b219607b8 |
13 | a895692793 |
14 | 569716d0ba |
15 | 2e24a2ae35 |
hex | 1a58fe267c |
113162200700 has 108 divisors (see below), whose sum is σ = 260261904672. Its totient is φ = 42701299200.
The previous prime is 113162200649. The next prime is 113162200703. The reversal of 113162200700 is 7002261311.
It is a super-4 number, since 4×1131622007004 (a number of 45 digits) contains 4444 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113162200703) by changing a digit.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 8693597 + ... + 8706603.
Almost surely, 2113162200700 is an apocalyptic number.
113162200700 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 113162200700, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (130130952336).
113162200700 is an abundant number, since it is smaller than the sum of its proper divisors (147099703972).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
113162200700 is a wasteful number, since it uses less digits than its factorization.
113162200700 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13300 (or 13274 counting only the distinct ones).
The product of its (nonzero) digits is 504, while the sum is 23.
The spelling of 113162200700 in words is "one hundred thirteen billion, one hundred sixty-two million, two hundred thousand, seven hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •