Base | Representation |
---|---|
bin | 110100110001111010… |
… | …1110011111000001000 |
3 | 101211120011002221121202 |
4 | 1221203311303320020 |
5 | 3324112103401300 |
6 | 124023011323332 |
7 | 11121526543160 |
oct | 1514365637010 |
9 | 354504087552 |
10 | 113344200200 |
11 | 44083934230 |
12 | 19b728b0548 |
13 | a8c42b67aa |
14 | 56b33c75a0 |
15 | 2e359cbad5 |
hex | 1a63d73e08 |
113344200200 has 96 divisors (see below), whose sum is σ = 328551024960. Its totient is φ = 35328057600.
The previous prime is 113344200197. The next prime is 113344200209. The reversal of 113344200200 is 2002443311.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is not an unprimeable number, because it can be changed into a prime (113344200209) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 3664607 + ... + 3695406.
It is an arithmetic number, because the mean of its divisors is an integer number (3422406510).
Almost surely, 2113344200200 is an apocalyptic number.
113344200200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
113344200200 is an abundant number, since it is smaller than the sum of its proper divisors (215206824760).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
113344200200 is a wasteful number, since it uses less digits than its factorization.
113344200200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7360047 (or 7360038 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 20.
Adding to 113344200200 its reverse (2002443311), we get a palindrome (115346643511).
The spelling of 113344200200 in words is "one hundred thirteen billion, three hundred forty-four million, two hundred thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •