Base | Representation |
---|---|
bin | 11001110001000011011101… |
… | …011111000000100100100000 |
3 | 112212020111020021221120021121 |
4 | 121301003131133000210200 |
5 | 104323132212023444300 |
6 | 1041003245204102024 |
7 | 32604153045412132 |
oct | 3161033537004440 |
9 | 485214207846247 |
10 | 113322133031200 |
11 | 33120712881095 |
12 | 10862709094914 |
13 | 4b303011bc312 |
14 | 1ddab6b669052 |
15 | d17b7e77081a |
hex | 6710dd7c0920 |
113322133031200 has 72 divisors (see below), whose sum is σ = 276653154635172. Its totient is φ = 45327952465920.
The previous prime is 113322133031167. The next prime is 113322133031281. The reversal of 113322133031200 is 2130331223311.
It can be written as a sum of positive squares in 6 ways, for example, as 2272773335184 + 111049359696016 = 1507572^2 + 10537996^2 .
It is a Harshad number since it is a multiple of its sum of digits (25).
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 39623812 + ... + 42387388.
Almost surely, 2113322133031200 is an apocalyptic number.
113322133031200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
113322133031200 is an abundant number, since it is smaller than the sum of its proper divisors (163331021603972).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
113322133031200 is a wasteful number, since it uses less digits than its factorization.
113322133031200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2814854 (or 2814841 counting only the distinct ones).
The product of its (nonzero) digits is 1944, while the sum is 25.
Adding to 113322133031200 its reverse (2130331223311), we get a palindrome (115452464254511).
The spelling of 113322133031200 in words is "one hundred thirteen trillion, three hundred twenty-two billion, one hundred thirty-three million, thirty-one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •