Base | Representation |
---|---|
bin | 1101001010010110011… |
… | …1111011100011011100 |
3 | 210121122111001010122110 |
4 | 3102211213323203130 |
5 | 12201041423220310 |
6 | 251513212114020 |
7 | 22223250565152 |
oct | 3224547734334 |
9 | 717574033573 |
10 | 226117007580 |
11 | 87994179592 |
12 | 379a6165910 |
13 | 184270ac709 |
14 | ad309533d2 |
15 | 5d3623bd20 |
hex | 34a59fb8dc |
226117007580 has 96 divisors (see below), whose sum is σ = 650633727744. Its totient is φ = 58642665984.
The previous prime is 226117007551. The next prime is 226117007591. The reversal of 226117007580 is 85700711622.
It is a super-2 number, since 2×2261170075802 (a number of 24 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 413067 + ... + 789213.
It is an arithmetic number, because the mean of its divisors is an integer number (6777434664).
Almost surely, 2226117007580 is an apocalyptic number.
226117007580 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 226117007580, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (325316863872).
226117007580 is an abundant number, since it is smaller than the sum of its proper divisors (424516720164).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
226117007580 is a wasteful number, since it uses less digits than its factorization.
226117007580 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 376435 (or 376433 counting only the distinct ones).
The product of its (nonzero) digits is 47040, while the sum is 39.
The spelling of 226117007580 in words is "two hundred twenty-six billion, one hundred seventeen million, seven thousand, five hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •