Base | Representation |
---|---|
bin | 11001101111011110000011… |
… | …001101011101101110101000 |
3 | 112211212002011122120220101122 |
4 | 121233132003031131232220 |
5 | 104314341211020101300 |
6 | 1040441240232434412 |
7 | 32563246506441032 |
oct | 3157360315355650 |
9 | 484762148526348 |
10 | 113213244300200 |
11 | 33089515a42910 |
12 | 1084559a548a08 |
13 | 4b22c69cba445 |
14 | 1dd579bcb8c52 |
15 | d14e09ed7c85 |
hex | 66f78335dba8 |
113213244300200 has 96 divisors (see below), whose sum is σ = 287163489288960. Its totient is φ = 41166512217600.
The previous prime is 113213244300161. The next prime is 113213244300269. The reversal of 113213244300200 is 2003442312311.
It is a self number, because there is not a number n which added to its sum of digits gives 113213244300200.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 45893444 + ... + 48297356.
It is an arithmetic number, because the mean of its divisors is an integer number (2991286346760).
Almost surely, 2113213244300200 is an apocalyptic number.
113213244300200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
113213244300200 is an abundant number, since it is smaller than the sum of its proper divisors (173950244988760).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
113213244300200 is a wasteful number, since it uses less digits than its factorization.
113213244300200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2425347 (or 2425338 counting only the distinct ones).
The product of its (nonzero) digits is 3456, while the sum is 26.
Adding to 113213244300200 its reverse (2003442312311), we get a palindrome (115216686612511).
The spelling of 113213244300200 in words is "one hundred thirteen trillion, two hundred thirteen billion, two hundred forty-four million, three hundred thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •