Base | Representation |
---|---|
bin | 11101100001111100100… |
… | …10001101010000100011 |
3 | 10121000000012121110210022 |
4 | 32300332102031100203 |
5 | 113111004223222042 |
6 | 2054043242024055 |
7 | 133210103153303 |
oct | 16607622152043 |
9 | 3530005543708 |
10 | 1014657242147 |
11 | 36134a61995a |
12 | 1447927a802b |
13 | 748b2ac5ba3 |
14 | 37176d27603 |
15 | 1b5d8422cd2 |
hex | ec3e48d423 |
1014657242147 has 2 divisors, whose sum is σ = 1014657242148. Its totient is φ = 1014657242146.
The previous prime is 1014657242143. The next prime is 1014657242171. The reversal of 1014657242147 is 7412427564101.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1014657242147 - 22 = 1014657242143 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1014657242098 and 1014657242107.
It is not a weakly prime, because it can be changed into another prime (1014657242143) 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, 507328621073 + 507328621074.
It is an arithmetic number, because the mean of its divisors is an integer number (507328621074).
Almost surely, 21014657242147 is an apocalyptic number.
1014657242147 is a deficient number, since it is larger than the sum of its proper divisors (1).
1014657242147 is an equidigital number, since it uses as much as digits as its factorization.
1014657242147 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 376320, while the sum is 44.
The spelling of 1014657242147 in words is "one trillion, fourteen billion, six hundred fifty-seven million, two hundred forty-two thousand, one hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •