Base | Representation |
---|---|
bin | 11001110000111010111110… |
… | …011111110011011011000000 |
3 | 112212012121201102012202112212 |
4 | 121300322332133303123000 |
5 | 104323010032420224300 |
6 | 1040555141221041252 |
7 | 32603411230256141 |
oct | 3160727637633300 |
9 | 485177642182485 |
10 | 113313023211200 |
11 | 331178685a152a |
12 | 108609a6256228 |
13 | 4b2c4aba6a897 |
14 | 1dda545827ac8 |
15 | d177e9aee935 |
hex | 670ebe7f36c0 |
113313023211200 has 168 divisors, whose sum is σ = 295247594511504. Its totient is φ = 42655334400000.
The previous prime is 113313023211161. The next prime is 113313023211281. The reversal of 113313023211200 is 2112320313311.
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, 325437200 + ... + 325785200.
Almost surely, 2113313023211200 is an apocalyptic number.
113313023211200 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 113313023211200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (147623797255752).
113313023211200 is an abundant number, since it is smaller than the sum of its proper divisors (181934571300304).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
113313023211200 is a wasteful number, since it uses less digits than its factorization.
113313023211200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 360011 (or 359996 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 113313023211200 its reverse (2112320313311), we get a palindrome (115425343524511).
The spelling of 113313023211200 in words is "one hundred thirteen trillion, three hundred thirteen billion, twenty-three million, two hundred eleven thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •