Base | Representation |
---|---|
bin | 110100101110111100… |
… | …1001110000001000000 |
3 | 101211022012101010011222 |
4 | 1221131321032001000 |
5 | 3323411033233100 |
6 | 124005045054212 |
7 | 11116205530133 |
oct | 1513571160100 |
9 | 354265333158 |
10 | 113244430400 |
11 | 4403258a752 |
12 | 19b453b7368 |
13 | a8a97239ca |
14 | 56a405621a |
15 | 2e2bd70485 |
hex | 1a5de4e040 |
113244430400 has 42 divisors (see below), whose sum is σ = 278652080490. Its totient is φ = 45297771520.
The previous prime is 113244430379. The next prime is 113244430427. The reversal of 113244430400 is 4034442311.
It can be written as a sum of positive squares in 3 ways, for example, as 11947364416 + 101297065984 = 109304^2 + 318272^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 113244430400.
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 35387285 + ... + 35390484.
It is an arithmetic number, because the mean of its divisors is an integer number (6634573345).
Almost surely, 2113244430400 is an apocalyptic number.
113244430400 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
113244430400 is an abundant number, since it is smaller than the sum of its proper divisors (165407650090).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
113244430400 is an equidigital number, since it uses as much as digits as its factorization.
113244430400 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 70777791 (or 70777776 counting only the distinct ones).
The product of its (nonzero) digits is 4608, while the sum is 26.
Adding to 113244430400 its reverse (4034442311), we get a palindrome (117278872711).
The spelling of 113244430400 in words is "one hundred thirteen billion, two hundred forty-four million, four hundred thirty thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •