Base | Representation |
---|---|
bin | 110100110111101001… |
… | …1000000111110011000 |
3 | 101212001112202222120212 |
4 | 1221233103000332120 |
5 | 3330010304433100 |
6 | 124054035110252 |
7 | 11126352344165 |
oct | 1515723007630 |
9 | 355045688525 |
10 | 113536405400 |
11 | 44172382900 |
12 | 1a007142388 |
13 | a925071b92 |
14 | 56d0b3b06c |
15 | 2e477e6635 |
hex | 1a6f4c0f98 |
113536405400 has 288 divisors, whose sum is σ = 298554016320. Its totient is φ = 40104345600.
The previous prime is 113536405397. The next prime is 113536405429. The reversal of 113536405400 is 4504635311.
It is a congruent number.
It is an unprimeable number.
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 71 ways as a sum of consecutive naturals, for example, 196769912 + ... + 196770488.
It is an arithmetic number, because the mean of its divisors is an integer number (1036645890).
Almost surely, 2113536405400 is an apocalyptic number.
113536405400 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 113536405400, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (149277008160).
113536405400 is an abundant number, since it is smaller than the sum of its proper divisors (185017610920).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
113536405400 is a wasteful number, since it uses less digits than its factorization.
113536405400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 835 (or 815 counting only the distinct ones).
The product of its (nonzero) digits is 21600, while the sum is 32.
The spelling of 113536405400 in words is "one hundred thirteen billion, five hundred thirty-six million, four hundred five thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •