Base | Representation |
---|---|
bin | 10100111011000001… |
… | …001011010010101101 |
3 | 2010222121212021102001 |
4 | 110323001023102231 |
5 | 332002020004441 |
6 | 14153102532301 |
7 | 1423463232430 |
oct | 247301132255 |
9 | 63877767361 |
10 | 22465000621 |
11 | 95889a8518 |
12 | 442b597091 |
13 | 21702a169b |
14 | 1131825817 |
15 | 8b7381731 |
hex | 53b04b4ad |
22465000621 has 4 divisors (see below), whose sum is σ = 25674286432. Its totient is φ = 19255714812.
The previous prime is 22465000619. The next prime is 22465000627. The reversal of 22465000621 is 12600056422.
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.
It is a cyclic number.
It is not a de Polignac number, because 22465000621 - 21 = 22465000619 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 22465000621.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22465000627) 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, 1604642895 + ... + 1604642908.
It is an arithmetic number, because the mean of its divisors is an integer number (6418571608).
Almost surely, 222465000621 is an apocalyptic number.
It is an amenable number.
22465000621 is a deficient number, since it is larger than the sum of its proper divisors (3209285811).
22465000621 is an equidigital number, since it uses as much as digits as its factorization.
22465000621 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3209285810.
The product of its (nonzero) digits is 5760, while the sum is 28.
The spelling of 22465000621 in words is "twenty-two billion, four hundred sixty-five million, six hundred twenty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •