Base | Representation |
---|---|
bin | 100001001100111… |
… | …0000010000111110 |
3 | 2212122021110221101 |
4 | 1002121300100332 |
5 | 4240144010200 |
6 | 302313523314 |
7 | 36415151020 |
oct | 10231602076 |
9 | 2778243841 |
10 | 1114047550 |
11 | 52193a460 |
12 | 27111353a |
13 | 149a5b945 |
14 | a7d58010 |
15 | 67c0d26a |
hex | 4267043e |
1114047550 has 144 divisors (see below), whose sum is σ = 2705576832. Its totient is φ = 331531200.
The previous prime is 1114047511. The next prime is 1114047551. The reversal of 1114047550 is 557404111.
It is a super-3 number, since 3×11140475503 (a number of 28 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1114047551) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 2036377 + ... + 2036923.
It is an arithmetic number, because the mean of its divisors is an integer number (18788728).
Almost surely, 21114047550 is an apocalyptic number.
1114047550 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1114047550 is an abundant number, since it is smaller than the sum of its proper divisors (1591529282).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1114047550 is a wasteful number, since it uses less digits than its factorization.
1114047550 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 623 (or 595 counting only the distinct ones).
The product of its (nonzero) digits is 2800, while the sum is 28.
The square root of 1114047550 is about 33377.3508535354. The cubic root of 1114047550 is about 1036.6557858865.
The spelling of 1114047550 in words is "one billion, one hundred fourteen million, forty-seven thousand, five hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •