Base | Representation |
---|---|
bin | 100001001101101… |
… | …1111101110111001 |
3 | 2212200010200020102 |
4 | 1002123133232321 |
5 | 4240303112441 |
6 | 302331405145 |
7 | 36422062103 |
oct | 10233375671 |
9 | 2780120212 |
10 | 1114504121 |
11 | 522121495 |
12 | 2712b37b5 |
13 | 149b8b6c3 |
14 | a8036573 |
15 | 67c9d69b |
hex | 426dfbb9 |
1114504121 has 8 divisors (see below), whose sum is σ = 1153643520. Its totient is φ = 1075839408.
The previous prime is 1114504117. The next prime is 1114504129. The reversal of 1114504121 is 1214054111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1114504121 - 22 = 1114504117 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1114504093 and 1114504102.
It is not an unprimeable number, because it can be changed into a prime (1114504129) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 113891 + ... + 123288.
It is an arithmetic number, because the mean of its divisors is an integer number (144205440).
Almost surely, 21114504121 is an apocalyptic number.
It is an amenable number.
1114504121 is a deficient number, since it is larger than the sum of its proper divisors (39139399).
1114504121 is a wasteful number, since it uses less digits than its factorization.
1114504121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 237343.
The product of its (nonzero) digits is 160, while the sum is 20.
The square root of 1114504121 is about 33384.1896861374. The cubic root of 1114504121 is about 1036.7973843683.
Adding to 1114504121 its reverse (1214054111), we get a palindrome (2328558232).
The spelling of 1114504121 in words is "one billion, one hundred fourteen million, five hundred four thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •