Base | Representation |
---|---|
bin | 10100111011100111… |
… | …001100110000100001 |
3 | 2011000022121200012211 |
4 | 110323213030300201 |
5 | 332012042434342 |
6 | 14154100322121 |
7 | 1423644035221 |
oct | 247347146041 |
9 | 64008550184 |
10 | 22474968097 |
11 | 95935961aa |
12 | 44329a3341 |
13 | 21723814ba |
14 | 1132c9c081 |
15 | 8b819ec17 |
hex | 53b9ccc21 |
22474968097 has 4 divisors (see below), whose sum is σ = 22478957956. Its totient is φ = 22470978240.
The previous prime is 22474968079. The next prime is 22474968143. The reversal of 22474968097 is 79086947422.
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 21881509776 + 593458321 = 147924^2 + 24361^2 .
It is a cyclic number.
It is not a de Polignac number, because 22474968097 - 223 = 22466579489 is a prime.
It is a super-2 number, since 2×224749680972 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (22474968017) 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 3 ways as a sum of consecutive naturals, for example, 1986468 + ... + 1997749.
It is an arithmetic number, because the mean of its divisors is an integer number (5619739489).
Almost surely, 222474968097 is an apocalyptic number.
It is an amenable number.
22474968097 is a deficient number, since it is larger than the sum of its proper divisors (3989859).
22474968097 is an equidigital number, since it uses as much as digits as its factorization.
22474968097 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3989858.
The product of its (nonzero) digits is 12192768, while the sum is 58.
The spelling of 22474968097 in words is "twenty-two billion, four hundred seventy-four million, nine hundred sixty-eight thousand, ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •