Base | Representation |
---|---|
bin | 111110010101000… |
… | …1111001110100000 |
3 | 12101202102112012102 |
4 | 1330222033032200 |
5 | 13240402302300 |
6 | 543310545532 |
7 | 102554002463 |
oct | 17452171640 |
9 | 5352375172 |
10 | 2091447200 |
11 | 983627267 |
12 | 4a45082a8 |
13 | 2743b4c2b |
14 | 15baa12da |
15 | c39280d5 |
hex | 7ca8f3a0 |
2091447200 has 72 divisors (see below), whose sum is σ = 5243812812. Its totient is φ = 813957120.
The previous prime is 2091447199. The next prime is 2091447203. The reversal of 2091447200 is 27441902.
It can be written as a sum of positive squares in 6 ways, for example, as 1737555856 + 353891344 = 41684^2 + 18812^2 .
It is not an unprimeable number, because it can be changed into a prime (2091447203) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 5729 + ... + 64928.
Almost surely, 22091447200 is an apocalyptic number.
2091447200 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 2091447200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2621906406).
2091447200 is an abundant number, since it is smaller than the sum of its proper divisors (3152365612).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2091447200 is a wasteful number, since it uses less digits than its factorization.
2091447200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 70714 (or 70701 counting only the distinct ones).
The product of its (nonzero) digits is 4032, while the sum is 29.
The square root of 2091447200 is about 45732.3430407846. The cubic root of 2091447200 is about 1278.8383014568.
The spelling of 2091447200 in words is "two billion, ninety-one million, four hundred forty-seven thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •