Base | Representation |
---|---|
bin | 101010101111110… |
… | …0101110100111001 |
3 | 10200221222021010001 |
4 | 1111133211310321 |
5 | 10414143013021 |
6 | 354154553001 |
7 | 50354505103 |
oct | 12537456471 |
9 | 3627867101 |
10 | 1434344761 |
11 | 6767174a3 |
12 | 340438761 |
13 | 19b215215 |
14 | d86d2573 |
15 | 85dcb091 |
hex | 557e5d39 |
1434344761 has 2 divisors, whose sum is σ = 1434344762. Its totient is φ = 1434344760.
The previous prime is 1434344729. The next prime is 1434344767. The reversal of 1434344761 is 1674434341.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1294632361 + 139712400 = 35981^2 + 11820^2 .
It is a cyclic number.
It is not a de Polignac number, because 1434344761 - 25 = 1434344729 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1434344761.
It is not a weakly prime, because it can be changed into another prime (1434344767) 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, 717172380 + 717172381.
It is an arithmetic number, because the mean of its divisors is an integer number (717172381).
Almost surely, 21434344761 is an apocalyptic number.
It is an amenable number.
1434344761 is a deficient number, since it is larger than the sum of its proper divisors (1).
1434344761 is an equidigital number, since it uses as much as digits as its factorization.
1434344761 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 96768, while the sum is 37.
The square root of 1434344761 is about 37872.7443024664. The cubic root of 1434344761 is about 1127.7630220051.
The spelling of 1434344761 in words is "one billion, four hundred thirty-four million, three hundred forty-four thousand, seven hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •