Base | Representation |
---|---|
bin | 101010101111111… |
… | …0000110000011011 |
3 | 10200222001112112012 |
4 | 1111133300300123 |
5 | 10414200431111 |
6 | 354155540135 |
7 | 50355052451 |
oct | 12537606033 |
9 | 3628045465 |
10 | 1434389531 |
11 | 6767480a3 |
12 | 34045a64b |
13 | 19b22c703 |
14 | d87049d1 |
15 | 85dd948b |
hex | 557f0c1b |
1434389531 has 2 divisors, whose sum is σ = 1434389532. Its totient is φ = 1434389530.
The previous prime is 1434389527. The next prime is 1434389557. The reversal of 1434389531 is 1359834341.
It is a weak prime.
It is an emirp because it is prime and its reverse (1359834341) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1434389531 - 22 = 1434389527 is a prime.
It is a super-2 number, since 2×14343895312 = 4114946653284799922, which contains 22 as substring.
It is a Sophie Germain prime.
It is not a weakly prime, because it can be changed into another prime (1434389581) 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, 717194765 + 717194766.
It is an arithmetic number, because the mean of its divisors is an integer number (717194766).
Almost surely, 21434389531 is an apocalyptic number.
1434389531 is a deficient number, since it is larger than the sum of its proper divisors (1).
1434389531 is an equidigital number, since it uses as much as digits as its factorization.
1434389531 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 155520, while the sum is 41.
The square root of 1434389531 is about 37873.3353561579. The cubic root of 1434389531 is about 1127.7747554522.
The spelling of 1434389531 in words is "one billion, four hundred thirty-four million, three hundred eighty-nine thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •