Base | Representation |
---|---|
bin | 100001010010010… |
… | …1000101011010011 |
3 | 2212211122101211120 |
4 | 1002210220223103 |
5 | 4241411300201 |
6 | 302455013323 |
7 | 36451331241 |
oct | 10244505323 |
9 | 2784571746 |
10 | 1116900051 |
11 | 5235085a3 |
12 | 27206a243 |
13 | 14a51a107 |
14 | a849b791 |
15 | 680c3536 |
hex | 42928ad3 |
1116900051 has 16 divisors (see below), whose sum is σ = 1583100288. Its totient is φ = 698000000.
The previous prime is 1116900049. The next prime is 1116900053. The reversal of 1116900051 is 1500096111.
It is an interprime number because it is at equal distance from previous prime (1116900049) and next prime (1116900053).
It is a cyclic number.
It is not a de Polignac number, because 1116900051 - 21 = 1116900049 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1116899994 and 1116900030.
It is not an unprimeable number, because it can be changed into a prime (1116900053) 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 15 ways as a sum of consecutive naturals, for example, 30825 + ... + 56426.
It is an arithmetic number, because the mean of its divisors is an integer number (98943768).
Almost surely, 21116900051 is an apocalyptic number.
1116900051 is a deficient number, since it is larger than the sum of its proper divisors (466200237).
1116900051 is a wasteful number, since it uses less digits than its factorization.
1116900051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 87522.
The product of its (nonzero) digits is 270, while the sum is 24.
The square root of 1116900051 is about 33420.0546229356. The cubic root of 1116900051 is about 1037.5398120108.
Adding to 1116900051 its reverse (1500096111), we get a palindrome (2616996162).
The spelling of 1116900051 in words is "one billion, one hundred sixteen million, nine hundred thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.166 sec. • engine limits •