Base | Representation |
---|---|
bin | 1101001100000001100… |
… | …1010100101111000000 |
3 | 210122210210012121120220 |
4 | 3103000121110233000 |
5 | 12203001414212032 |
6 | 252025535103040 |
7 | 22240343420262 |
oct | 3230031245700 |
9 | 718723177526 |
10 | 226566163392 |
11 | 880a4768a38 |
12 | 37ab0671a80 |
13 | 1849917209a |
14 | ad74471b32 |
15 | 5d608b012c |
hex | 34c0654bc0 |
226566163392 has 224 divisors, whose sum is σ = 654275584512. Its totient is φ = 68913954816.
The previous prime is 226566163391. The next prime is 226566163403. The reversal of 226566163392 is 293361665622.
It is a hoax number, since the sum of its digits (51) coincides with the sum of the digits of its distinct prime factors.
It is a Harshad number since it is a multiple of its sum of digits (51).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (226566163391) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 19222333 + ... + 19234115.
Almost surely, 2226566163392 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 226566163392, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (327137792256).
226566163392 is an abundant number, since it is smaller than the sum of its proper divisors (427709421120).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
226566163392 is a wasteful number, since it uses less digits than its factorization.
226566163392 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11995 (or 11985 counting only the distinct ones).
The product of its digits is 4199040, while the sum is 51.
The spelling of 226566163392 in words is "two hundred twenty-six billion, five hundred sixty-six million, one hundred sixty-three thousand, three hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •