Base | Representation |
---|---|
bin | 10100101100011010… |
… | …110111010001000000 |
3 | 2010100112222211010100 |
4 | 110230122313101000 |
5 | 331001314413341 |
6 | 14112513202400 |
7 | 1414430346651 |
oct | 245432672100 |
9 | 63315884110 |
10 | 22220076096 |
11 | 9472721059 |
12 | 4381560400 |
13 | 213161822a |
14 | 110b0ab528 |
15 | 8a0b013b6 |
hex | 52c6b7440 |
22220076096 has 63 divisors (see below), whose sum is σ = 63700092183. Its totient is φ = 7405499520.
The previous prime is 22220076077. The next prime is 22220076101. The reversal of 22220076096 is 69067002222.
The square root of 22220076096 is 149064.
It is a perfect power (a square), and thus also a powerful number.
22220076096 is a `hidden beast` number, since 2 + 22 + 20 + 0 + 7 + 609 + 6 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a self number, because there is not a number n which added to its sum of digits gives 22220076096.
It is an unprimeable number.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 3574431 + ... + 3580641.
Almost surely, 222220076096 is an apocalyptic number.
22220076096 is the 149064-th square number.
It is an amenable number.
22220076096 is an abundant number, since it is smaller than the sum of its proper divisors (41480016087).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22220076096 is an frugal number, since it uses more digits than its factorization.
22220076096 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12440 (or 6216 counting only the distinct ones).
The product of its (nonzero) digits is 36288, while the sum is 36.
Multiplying 22220076096 by its sum of digits (36), we get a square (799922739456 = 8943842).
22220076096 divided by its sum of digits (36) gives a square (617224336 = 248442).
The spelling of 22220076096 in words is "twenty-two billion, two hundred twenty million, seventy-six thousand, ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •