Base | Representation |
---|---|
bin | 101010110000011… |
… | …0111101011111001 |
3 | 10200222121022001102 |
4 | 1111200313223321 |
5 | 10414234230212 |
6 | 354210101145 |
7 | 50360402456 |
oct | 12540675371 |
9 | 3628538042 |
10 | 1434680057 |
11 | 6769263a8 |
12 | 34057a7b5 |
13 | 19b301a15 |
14 | d877c82d |
15 | 85e455c2 |
hex | 55837af9 |
1434680057 has 2 divisors, whose sum is σ = 1434680058. Its totient is φ = 1434680056.
The previous prime is 1434680047. The next prime is 1434680059. The reversal of 1434680057 is 7500864341.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1253938921 + 180741136 = 35411^2 + 13444^2 .
It is an emirp because it is prime and its reverse (7500864341) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1434680057 - 212 = 1434675961 is a prime.
Together with 1434680059, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1434680057.
It is not a weakly prime, because it can be changed into another prime (1434680059) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 717340028 + 717340029.
It is an arithmetic number, because the mean of its divisors is an integer number (717340029).
Almost surely, 21434680057 is an apocalyptic number.
It is an amenable number.
1434680057 is a deficient number, since it is larger than the sum of its proper divisors (1).
1434680057 is an equidigital number, since it uses as much as digits as its factorization.
1434680057 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 80640, while the sum is 38.
The square root of 1434680057 is about 37877.1706572706. The cubic root of 1434680057 is about 1127.8508913885.
The spelling of 1434680057 in words is "one billion, four hundred thirty-four million, six hundred eighty thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •