Base | Representation |
---|---|
bin | 1010010000101101010011… |
… | …11011111011010000110001 |
3 | 2221220010102212011020002021 |
4 | 11020112221323323100301 |
5 | 10424143203422432000 |
6 | 115553523004151441 |
7 | 4516134512441110 |
oct | 510265173732061 |
9 | 87803385136067 |
10 | 22564314264625 |
11 | 720a521174231 |
12 | 2645147238581 |
13 | c78a62198253 |
14 | 580193781c77 |
15 | 291e39d4a11a |
hex | 1485a9efb431 |
22564314264625 has 64 divisors (see below), whose sum is σ = 32506519398912. Its totient is φ = 15317255520000.
The previous prime is 22564314264623. The next prime is 22564314264631. The reversal of 22564314264625 is 52646241346522.
It is not a de Polignac number, because 22564314264625 - 21 = 22564314264623 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (22564314264623) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 809235934 + ... + 809263816.
It is an arithmetic number, because the mean of its divisors is an integer number (507914365608).
Almost surely, 222564314264625 is an apocalyptic number.
22564314264625 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
22564314264625 is a deficient number, since it is larger than the sum of its proper divisors (9942205134287).
22564314264625 is a wasteful number, since it uses less digits than its factorization.
22564314264625 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37163 (or 37153 counting only the distinct ones).
The product of its digits is 16588800, while the sum is 52.
The spelling of 22564314264625 in words is "twenty-two trillion, five hundred sixty-four billion, three hundred fourteen million, two hundred sixty-four thousand, six hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •