Base | Representation |
---|---|
bin | 10100110111110110000… |
… | …001100100100101010001 |
3 | 12002010022102210210220011 |
4 | 110313312001210211101 |
5 | 142000023014413224 |
6 | 3014533155114521 |
7 | 205425400266403 |
oct | 24676601444521 |
9 | 5063272723804 |
10 | 1434351716689 |
11 | 50333a1724a1 |
12 | 1b1ba15a2a41 |
13 | a5349728058 |
14 | 4d5cc9a0b73 |
15 | 2749dd36394 |
hex | 14df6064951 |
1434351716689 has 2 divisors, whose sum is σ = 1434351716690. Its totient is φ = 1434351716688.
The previous prime is 1434351716687. The next prime is 1434351716701. The reversal of 1434351716689 is 9866171534341.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1432868850625 + 1482866064 = 1197025^2 + 38508^2 .
It is a cyclic number.
It is not a de Polignac number, because 1434351716689 - 21 = 1434351716687 is a prime.
It is a super-2 number, since 2×14343517166892 (a number of 25 digits) contains 22 as substring.
Together with 1434351716687, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (1434351716683) 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, 717175858344 + 717175858345.
It is an arithmetic number, because the mean of its divisors is an integer number (717175858345).
Almost surely, 21434351716689 is an apocalyptic number.
It is an amenable number.
1434351716689 is a deficient number, since it is larger than the sum of its proper divisors (1).
1434351716689 is an equidigital number, since it uses as much as digits as its factorization.
1434351716689 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 13063680, while the sum is 58.
The spelling of 1434351716689 in words is "one trillion, four hundred thirty-four billion, three hundred fifty-one million, seven hundred sixteen thousand, six hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •