Base | Representation |
---|---|
bin | 1100111011100011101… |
… | …1000101000001010000 |
3 | 210020101201120020212101 |
4 | 3032320323011001100 |
5 | 12114423312430041 |
6 | 250015152010144 |
7 | 22022660242000 |
oct | 3167073050120 |
9 | 706351506771 |
10 | 222145826896 |
11 | 86236589784 |
12 | 37078230954 |
13 | 17c4343b766 |
14 | aa75382000 |
15 | 5ba27aab31 |
hex | 33b8ec5050 |
222145826896 has 160 divisors (see below), whose sum is σ = 519038208000. Its totient is φ = 91971855360.
The previous prime is 222145826893. The next prime is 222145826897. The reversal of 222145826896 is 698628541222.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (222145826893) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 172339020 + ... + 172340308.
It is an arithmetic number, because the mean of its divisors is an integer number (3243988800).
Almost surely, 2222145826896 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 222145826896, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (259519104000).
222145826896 is an abundant number, since it is smaller than the sum of its proper divisors (296892381104).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
222145826896 is a wasteful number, since it uses less digits than its factorization.
222145826896 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2362 (or 2342 counting only the distinct ones).
The product of its digits is 6635520, while the sum is 55.
The spelling of 222145826896 in words is "two hundred twenty-two billion, one hundred forty-five million, eight hundred twenty-six thousand, eight hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.126 sec. • engine limits •