Base | Representation |
---|---|
bin | 1000001100110111… |
… | …1011011101001100 |
3 | 12200102110002120201 |
4 | 2003031323131030 |
5 | 14002033413300 |
6 | 1002241023244 |
7 | 105361105156 |
oct | 20315733514 |
9 | 5612402521 |
10 | 2201466700 |
11 | a2a741574 |
12 | 515324b24 |
13 | 291126124 |
14 | 16c53dad6 |
15 | cd40b66a |
hex | 8337b74c |
2201466700 has 144 divisors (see below), whose sum is σ = 5107110624. Its totient is φ = 822528000.
The previous prime is 2201466653. The next prime is 2201466719. The reversal of 2201466700 is 76641022.
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 47 ways as a sum of consecutive naturals, for example, 16069032 + ... + 16069168.
It is an arithmetic number, because the mean of its divisors is an integer number (35466046).
Almost surely, 22201466700 is an apocalyptic number.
2201466700 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2201466700, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2553555312).
2201466700 is an abundant number, since it is smaller than the sum of its proper divisors (2905643924).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2201466700 is a wasteful number, since it uses less digits than its factorization.
2201466700 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 332 (or 325 counting only the distinct ones).
The product of its (nonzero) digits is 4032, while the sum is 28.
The square root of 2201466700 is about 46919.7900677315. The cubic root of 2201466700 is about 1300.8804095357.
The spelling of 2201466700 in words is "two billion, two hundred one million, four hundred sixty-six thousand, seven hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •