Base | Representation |
---|---|
bin | 1101001101011001111… |
… | …1100100011000000000 |
3 | 210200202121210221100000 |
4 | 3103112133210120000 |
5 | 12204231321232242 |
6 | 252130421200000 |
7 | 22252464546312 |
oct | 3232637443000 |
9 | 720677727300 |
10 | 226936899072 |
11 | 88274a66164 |
12 | 37b94860000 |
13 | 18527c08500 |
14 | adab7b97b2 |
15 | 5d831e2a4c |
hex | 34d67e4600 |
226936899072 has 720 divisors, whose sum is σ = 755581514688. Its totient is φ = 67931136000.
The previous prime is 226936898983. The next prime is 226936899121. The reversal of 226936899072 is 270998639622.
226936899072 is a `hidden beast` number, since 2 + 269 + 368 + 9 + 9 + 0 + 7 + 2 = 666.
It is a super-2 number, since 2×2269368990722 (a number of 24 digits) contains 22 as substring.
It is a congruent number.
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 71 ways as a sum of consecutive naturals, for example, 904130947 + ... + 904131197.
Almost surely, 2226936899072 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 226936899072, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (377790757344).
226936899072 is an abundant number, since it is smaller than the sum of its proper divisors (528644615616).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
226936899072 is an equidigital number, since it uses as much as digits as its factorization.
226936899072 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 353 (or 312 counting only the distinct ones).
The product of its (nonzero) digits is 35271936, while the sum is 63.
The spelling of 226936899072 in words is "two hundred twenty-six billion, nine hundred thirty-six million, eight hundred ninety-nine thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •