Base | Representation |
---|---|
bin | 10000001101100101110… |
… | …010101110000010011011 |
3 | 10221111200211211200021102 |
4 | 100031211302232002123 |
5 | 121223141201334001 |
6 | 2211451254102015 |
7 | 143330354335262 |
oct | 20154562560233 |
9 | 3844624750242 |
10 | 1114104324251 |
11 | 39a541934616 |
12 | 15bb0734a90b |
13 | 810a0bb2c79 |
14 | 3bccc7795d9 |
15 | 1dea8d3ee6b |
hex | 10365cae09b |
1114104324251 has 2 divisors, whose sum is σ = 1114104324252. Its totient is φ = 1114104324250.
The previous prime is 1114104324209. The next prime is 1114104324341. The reversal of 1114104324251 is 1524234014111.
It is a weak prime.
It is an emirp because it is prime and its reverse (1524234014111) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1114104324251 - 26 = 1114104324187 is a prime.
It is a super-2 number, since 2×11141043242512 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1114104323251) 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 as a sum of consecutive naturals, namely, 557052162125 + 557052162126.
It is an arithmetic number, because the mean of its divisors is an integer number (557052162126).
Almost surely, 21114104324251 is an apocalyptic number.
1114104324251 is a deficient number, since it is larger than the sum of its proper divisors (1).
1114104324251 is an equidigital number, since it uses as much as digits as its factorization.
1114104324251 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3840, while the sum is 29.
Adding to 1114104324251 its reverse (1524234014111), we get a palindrome (2638338338362).
The spelling of 1114104324251 in words is "one trillion, one hundred fourteen billion, one hundred four million, three hundred twenty-four thousand, two hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.926 sec. • engine limits •