Base | Representation |
---|---|
bin | 111101000100001… |
… | …0101111000000000 |
3 | 12021210120100100000 |
4 | 1322020111320000 |
5 | 13144021211404 |
6 | 535153200000 |
7 | 101530162434 |
oct | 17210257000 |
9 | 5253510300 |
10 | 2049007104 |
11 | 96167a401 |
12 | 492260000 |
13 | 268675851 |
14 | 1561b49c4 |
15 | bed43339 |
hex | 7a215e00 |
2049007104 has 240 divisors, whose sum is σ = 6291597312. Its totient is φ = 665376768.
The previous prime is 2049007097. The next prime is 2049007117. The reversal of 2049007104 is 4017009402.
It is a happy number.
It is a super-2 number, since 2×20490071042 = 8396860224484933632, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 5349697 + ... + 5350079.
Almost surely, 22049007104 is an apocalyptic number.
2049007104 is a gapful number since it is divisible by the number (24) 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 2049007104, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3145798656).
2049007104 is an abundant number, since it is smaller than the sum of its proper divisors (4242590208).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2049007104 is an frugal number, since it uses more digits than its factorization.
2049007104 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 459 (or 431 counting only the distinct ones).
The product of its (nonzero) digits is 2016, while the sum is 27.
The square root of 2049007104 is about 45265.9596606545. The cubic root of 2049007104 is about 1270.1289686541.
The spelling of 2049007104 in words is "two billion, forty-nine million, seven thousand, one hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •