Base | Representation |
---|---|
bin | 101010110000011… |
… | …0110101011111001 |
3 | 10200222121002102201 |
4 | 1111200312223321 |
5 | 10414234112321 |
6 | 354210030201 |
7 | 50360354515 |
oct | 12540665371 |
9 | 3628532381 |
10 | 1434675961 |
11 | 676923314 |
12 | 340578361 |
13 | 19b2ccbb4 |
14 | d877b145 |
15 | 85e44291 |
hex | 55836af9 |
1434675961 has 2 divisors, whose sum is σ = 1434675962. Its totient is φ = 1434675960.
The previous prime is 1434675941. The next prime is 1434675971. The reversal of 1434675961 is 1695764341.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1388978361 + 45697600 = 37269^2 + 6760^2 .
It is a cyclic number.
It is not a de Polignac number, because 1434675961 - 29 = 1434675449 is a prime.
It is a super-2 number, since 2×14346759612 = 4116590226142547042, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1434675941) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 717337980 + 717337981.
It is an arithmetic number, because the mean of its divisors is an integer number (717337981).
Almost surely, 21434675961 is an apocalyptic number.
It is an amenable number.
1434675961 is a deficient number, since it is larger than the sum of its proper divisors (1).
1434675961 is an equidigital number, since it uses as much as digits as its factorization.
1434675961 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 544320, while the sum is 46.
The square root of 1434675961 is about 37877.1165877235. The cubic root of 1434675961 is about 1127.8498180525.
The spelling of 1434675961 in words is "one billion, four hundred thirty-four million, six hundred seventy-five thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •