Base | Representation |
---|---|
bin | 101010101111011… |
… | …1010001011001001 |
3 | 10200221122011211211 |
4 | 1111132322023021 |
5 | 10414121302321 |
6 | 354151053121 |
7 | 50353131604 |
oct | 12536721311 |
9 | 3627564754 |
10 | 1434165961 |
11 | 676605128 |
12 | 3403711a1 |
13 | 19b181a17 |
14 | d868733b |
15 | 85d930e1 |
hex | 557ba2c9 |
1434165961 has 4 divisors (see below), whose sum is σ = 1509648400. Its totient is φ = 1358683524.
The previous prime is 1434165959. The next prime is 1434165973. The reversal of 1434165961 is 1695614341.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 1695614341 = 107 ⋅15846863.
It is a cyclic number.
It is not a de Polignac number, because 1434165961 - 21 = 1434165959 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1434165461) 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 in 3 ways as a sum of consecutive naturals, for example, 37741191 + ... + 37741228.
It is an arithmetic number, because the mean of its divisors is an integer number (377412100).
Almost surely, 21434165961 is an apocalyptic number.
It is an amenable number.
1434165961 is a deficient number, since it is larger than the sum of its proper divisors (75482439).
1434165961 is an equidigital number, since it uses as much as digits as its factorization.
1434165961 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 75482438.
The product of its digits is 77760, while the sum is 40.
The square root of 1434165961 is about 37870.3836922733. The cubic root of 1434165961 is about 1127.7161591650.
The spelling of 1434165961 in words is "one billion, four hundred thirty-four million, one hundred sixty-five thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •