Base | Representation |
---|---|
bin | 1101001010011111001… |
… | …1000011010101111100 |
3 | 210121202000122222222020 |
4 | 3102213303003111330 |
5 | 12201130242240000 |
6 | 251520553520140 |
7 | 22224202561356 |
oct | 3224763032574 |
9 | 717660588866 |
10 | 226153477500 |
11 | 87a02818a15 |
12 | 379b6413050 |
13 | 1843180b552 |
14 | ad357280d6 |
15 | 5d39542ba0 |
hex | 34a7cc357c |
226153477500 has 120 divisors (see below), whose sum is σ = 659936352768. Its totient is φ = 60258840000.
The previous prime is 226153477423. The next prime is 226153477507. The reversal of 226153477500 is 5774351622.
It is a super-2 number, since 2×2261534775002 (a number of 24 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (226153477507) by changing a digit.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 9790965 + ... + 9814035.
Almost surely, 2226153477500 is an apocalyptic number.
226153477500 is a gapful number since it is divisible by the number (20) 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 226153477500, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (329968176384).
226153477500 is an abundant number, since it is smaller than the sum of its proper divisors (433782875268).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
226153477500 is a wasteful number, since it uses less digits than its factorization.
226153477500 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24405 (or 24388 counting only the distinct ones).
The product of its (nonzero) digits is 352800, while the sum is 42.
The spelling of 226153477500 in words is "two hundred twenty-six billion, one hundred fifty-three million, four hundred seventy-seven thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •