Base | Representation |
---|---|
bin | 10101000101000111… |
… | …011110101101110001 |
3 | 2011102102122221020111 |
4 | 111011013132231301 |
5 | 332323403101301 |
6 | 14221554141321 |
7 | 1430621303563 |
oct | 250507365561 |
9 | 64372587214 |
10 | 22634425201 |
11 | 96655a7733 |
12 | 4478281841 |
13 | 2199411b0b |
14 | 114a129333 |
15 | 8c719b551 |
hex | 5451deb71 |
22634425201 has 4 divisors (see below), whose sum is σ = 22634739712. Its totient is φ = 22634110692.
The previous prime is 22634425199. The next prime is 22634425207. The reversal of 22634425201 is 10252443622.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 22634425201 - 21 = 22634425199 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (22634425207) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 9976 + ... + 212998.
It is an arithmetic number, because the mean of its divisors is an integer number (5658684928).
Almost surely, 222634425201 is an apocalyptic number.
It is an amenable number.
22634425201 is a deficient number, since it is larger than the sum of its proper divisors (314511).
22634425201 is a wasteful number, since it uses less digits than its factorization.
22634425201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 314510.
The product of its (nonzero) digits is 23040, while the sum is 31.
Adding to 22634425201 its reverse (10252443622), we get a palindrome (32886868823).
The spelling of 22634425201 in words is "twenty-two billion, six hundred thirty-four million, four hundred twenty-five thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •