Base | Representation |
---|---|
bin | 1000001100101011… |
… | …0111110111100100 |
3 | 12200100221101122022 |
4 | 2003022313313210 |
5 | 14001332244242 |
6 | 1002211522312 |
7 | 105351230420 |
oct | 20312676744 |
9 | 5610841568 |
10 | 2200665572 |
11 | a2a244686 |
12 | 514bb9398 |
13 | 290c055a1 |
14 | 16c3b1b80 |
15 | cd2ee0d2 |
hex | 832b7de4 |
2200665572 has 96 divisors (see below), whose sum is σ = 4836464640. Its totient is φ = 854415360.
The previous prime is 2200665517. The next prime is 2200665581. The reversal of 2200665572 is 2755660022.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 4323254 + ... + 4323762.
It is an arithmetic number, because the mean of its divisors is an integer number (50379840).
Almost surely, 22200665572 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2200665572, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2418232320).
2200665572 is an abundant number, since it is smaller than the sum of its proper divisors (2635799068).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2200665572 is a wasteful number, since it uses less digits than its factorization.
2200665572 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 861 (or 859 counting only the distinct ones).
The product of its (nonzero) digits is 50400, while the sum is 35.
The square root of 2200665572 is about 46911.2520830557. The cubic root of 2200665572 is about 1300.7225907863.
It can be divided in two parts, 22006 and 65572, that added together give a palindrome (87578).
The spelling of 2200665572 in words is "two billion, two hundred million, six hundred sixty-five thousand, five hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •