Base | Representation |
---|---|
bin | 111110100001001… |
… | …011001101010010 |
3 | 2201002122211102102 |
4 | 332201023031102 |
5 | 4122003242200 |
6 | 252025120402 |
7 | 34664236664 |
oct | 7641131522 |
9 | 2632584372 |
10 | 1048884050 |
11 | 499082125 |
12 | 253329102 |
13 | 1393c4666 |
14 | 9d434534 |
15 | 6213a6d5 |
hex | 3e84b352 |
1048884050 has 24 divisors (see below), whose sum is σ = 1953999936. Its totient is φ = 418892240.
The previous prime is 1048884041. The next prime is 1048884061. The reversal of 1048884050 is 504888401.
1048884050 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×10488840502 = 2200315500688805000, which contains 22 as substring.
It is a hoax number, since the sum of its digits (38) coincides with the sum of the digits of its distinct prime factors.
It is a junction number, because it is equal to n+sod(n) for n = 1048883995 and 1048884013.
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, 16139 + ... + 48561.
It is an arithmetic number, because the mean of its divisors is an integer number (81416664).
Almost surely, 21048884050 is an apocalyptic number.
1048884050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1048884050 is a deficient number, since it is larger than the sum of its proper divisors (905115886).
1048884050 is a wasteful number, since it uses less digits than its factorization.
1048884050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33082 (or 33077 counting only the distinct ones).
The product of its (nonzero) digits is 40960, while the sum is 38.
The square root of 1048884050 is about 32386.4794320099. The cubic root of 1048884050 is about 1016.0361505985.
The spelling of 1048884050 in words is "one billion, forty-eight million, eight hundred eighty-four thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.162 sec. • engine limits •