Base | Representation |
---|---|
bin | 1000010010100110… |
… | …1011000001001110 |
3 | 12202002200221212120 |
4 | 2010221223001032 |
5 | 14024213012442 |
6 | 1004500313410 |
7 | 106102402440 |
oct | 20451530116 |
9 | 5662627776 |
10 | 2225516622 |
11 | a4227863a |
12 | 5213a2866 |
13 | 2960c6a54 |
14 | 171800490 |
15 | d05ac4ec |
hex | 84a6b04e |
2225516622 has 64 divisors (see below), whose sum is σ = 5181456384. Its totient is φ = 624111840.
The previous prime is 2225516611. The next prime is 2225516633. The reversal of 2225516622 is 2266155222.
It is an interprime number because it is at equal distance from previous prime (2225516611) and next prime (2225516633).
It is a congruent number.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 873883 + ... + 876425.
It is an arithmetic number, because the mean of its divisors is an integer number (80960256).
Almost surely, 22225516622 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2225516622, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2590728192).
2225516622 is an abundant number, since it is smaller than the sum of its proper divisors (2955939762).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2225516622 is a wasteful number, since it uses less digits than its factorization.
2225516622 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2933.
The product of its digits is 28800, while the sum is 33.
The square root of 2225516622 is about 47175.3815246893. The cubic root of 2225516622 is about 1305.6004189437.
The spelling of 2225516622 in words is "two billion, two hundred twenty-five million, five hundred sixteen thousand, six hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •