Base | Representation |
---|---|
bin | 11000111100011011001… |
… | …100001010100011000101 |
3 | 20001212111221010000220202 |
4 | 120330123030022203011 |
5 | 211041033404443434 |
6 | 3351245131140245 |
7 | 234562121441015 |
oct | 30743314124305 |
9 | 6055457100822 |
10 | 1714148124869 |
11 | 600a69a24174 |
12 | 2382688a4685 |
13 | c5849937bab |
14 | 5cd72781c45 |
15 | 2e8c7960a7e |
hex | 18f1b30a8c5 |
1714148124869 has 2 divisors, whose sum is σ = 1714148124870. Its totient is φ = 1714148124868.
The previous prime is 1714148124833. The next prime is 1714148124877. The reversal of 1714148124869 is 9684218414171.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1130475044644 + 583673080225 = 1063238^2 + 763985^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1714148124869 is a prime.
It is a super-2 number, since 2×17141481248692 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1714148144869) 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, 857074062434 + 857074062435.
It is an arithmetic number, because the mean of its divisors is an integer number (857074062435).
Almost surely, 21714148124869 is an apocalyptic number.
It is an amenable number.
1714148124869 is a deficient number, since it is larger than the sum of its proper divisors (1).
1714148124869 is an equidigital number, since it uses as much as digits as its factorization.
1714148124869 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 3096576, while the sum is 56.
The spelling of 1714148124869 in words is "one trillion, seven hundred fourteen billion, one hundred forty-eight million, one hundred twenty-four thousand, eight hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •