Base | Representation |
---|---|
bin | 10100101110101110… |
… | …010000010111010100 |
3 | 2010110020200211110100 |
4 | 110232232100113110 |
5 | 331041212322233 |
6 | 14120413254100 |
7 | 1415406643053 |
oct | 245656202724 |
9 | 63406624410 |
10 | 22258714068 |
11 | 9492511368 |
12 | 4392494330 |
13 | 2139625b36 |
14 | 111228839a |
15 | 8a41d4813 |
hex | 52eb905d4 |
22258714068 has 36 divisors (see below), whose sum is σ = 56280148288. Its totient is φ = 7417584720.
The previous prime is 22258714013. The next prime is 22258714069. The reversal of 22258714068 is 86041785222.
22258714068 is a `hidden beast` number, since 2 + 2 + 2 + 587 + 1 + 4 + 0 + 68 = 666.
It is a tau number, because it is divible by the number of its divisors (36).
It is a super-2 number, since 2×222587140682 (a number of 21 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (45) coincides with the sum of the digits of its prime factors.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22258714069) 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 11 ways as a sum of consecutive naturals, for example, 56763 + ... + 218493.
Almost surely, 222258714068 is an apocalyptic number.
It is an amenable number.
22258714068 is an abundant number, since it is smaller than the sum of its proper divisors (34021434220).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22258714068 is a wasteful number, since it uses less digits than its factorization.
22258714068 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 165564 (or 165559 counting only the distinct ones).
The product of its (nonzero) digits is 430080, while the sum is 45.
The spelling of 22258714068 in words is "twenty-two billion, two hundred fifty-eight million, seven hundred fourteen thousand, sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •