Base | Representation |
---|---|
bin | 1011101100010… |
… | …1111110011000 |
3 | 10102021202122022 |
4 | 2323011332120 |
5 | 100023423100 |
6 | 4511114012 |
7 | 1133610335 |
oct | 273057630 |
9 | 112252568 |
10 | 49045400 |
11 | 25759598 |
12 | 14512908 |
13 | a212a61 |
14 | 672998c |
15 | 448be85 |
hex | 2ec5f98 |
49045400 has 48 divisors (see below), whose sum is σ = 114602040. Its totient is φ = 19520000.
The previous prime is 49045369. The next prime is 49045411. The reversal of 49045400 is 454094.
It is a super-2 number, since 2×490454002 = 4810902522320000, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 49045400.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 49712 + ... + 50688.
Almost surely, 249045400 is an apocalyptic number.
49045400 is a gapful number since it is divisible by the number (40) 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 49045400, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (57301020).
49045400 is an abundant number, since it is smaller than the sum of its proper divisors (65556640).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
49045400 is a wasteful number, since it uses less digits than its factorization.
49045400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1244 (or 1235 counting only the distinct ones).
The product of its (nonzero) digits is 2880, while the sum is 26.
The square root of 49045400 is about 7003.2421063390. The cubic root of 49045400 is about 366.0435514082.
Adding to 49045400 its reverse (454094), we get a palindrome (49499494).
The spelling of 49045400 in words is "forty-nine million, forty-five thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •