Base | Representation |
---|---|
bin | 10100110000111001… |
… | …010100100001000001 |
3 | 2010112210021221100022 |
4 | 110300321110201001 |
5 | 331130030402324 |
6 | 14124154503225 |
7 | 1416331544654 |
oct | 246071244101 |
9 | 63483257308 |
10 | 22295169089 |
11 | 9501050586 |
12 | 43a2734b15 |
13 | 214404ac5b |
14 | 111705789b |
15 | 8a74d605e |
hex | 530e54841 |
22295169089 has 4 divisors (see below), whose sum is σ = 22301782356. Its totient is φ = 22288555824.
The previous prime is 22295169073. The next prime is 22295169109. The reversal of 22295169089 is 98096159222.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 10492519489 + 11802649600 = 102433^2 + 108640^2 .
It is a cyclic number.
It is not a de Polignac number, because 22295169089 - 24 = 22295169073 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 22295169089.
It is not an unprimeable number, because it can be changed into a prime (22295169019) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3301574 + ... + 3308319.
It is an arithmetic number, because the mean of its divisors is an integer number (5575445589).
Almost surely, 222295169089 is an apocalyptic number.
It is an amenable number.
22295169089 is a deficient number, since it is larger than the sum of its proper divisors (6613267).
22295169089 is an equidigital number, since it uses as much as digits as its factorization.
22295169089 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6613266.
The product of its (nonzero) digits is 1399680, while the sum is 53.
The spelling of 22295169089 in words is "twenty-two billion, two hundred ninety-five million, one hundred sixty-nine thousand, eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •