Base | Representation |
---|---|
bin | 110100110010001111… |
… | …1010110011001000000 |
3 | 101211120220121011220010 |
4 | 1221210133112121000 |
5 | 3324122400330342 |
6 | 124024040544520 |
7 | 11122021235262 |
oct | 1514437263100 |
9 | 354526534803 |
10 | 113355089472 |
11 | 44089aa1529 |
12 | 19b76482140 |
13 | a8c662a051 |
14 | 56b4a1db32 |
15 | 2e3692d29c |
hex | 1a647d6640 |
113355089472 has 112 divisors (see below), whose sum is σ = 301231198400. Its totient is φ = 37620080640.
The previous prime is 113355089467. The next prime is 113355089489. The reversal of 113355089472 is 274980553311.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 54261804 + ... + 54263892.
Almost surely, 2113355089472 is an apocalyptic number.
113355089472 is a gapful number since it is divisible by the number (12) 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 113355089472, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (150615599200).
113355089472 is an abundant number, since it is smaller than the sum of its proper divisors (187876108928).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
113355089472 is a wasteful number, since it uses less digits than its factorization.
113355089472 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3204 (or 3194 counting only the distinct ones).
The product of its (nonzero) digits is 907200, while the sum is 48.
The spelling of 113355089472 in words is "one hundred thirteen billion, three hundred fifty-five million, eighty-nine thousand, four hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •