Base | Representation |
---|---|
bin | 101010101111110… |
… | …0111001101001011 |
3 | 10200221222112212022 |
4 | 1111133213031023 |
5 | 10414143203121 |
6 | 354155035055 |
7 | 50354530424 |
oct | 12537471513 |
9 | 3627875768 |
10 | 1434350411 |
11 | 67672076a |
12 | 34043ba8b |
13 | 19b217970 |
14 | d86d464b |
15 | 85dccaab |
hex | 557e734b |
1434350411 has 8 divisors (see below), whose sum is σ = 1597950480. Its totient is φ = 1278359712.
The previous prime is 1434350381. The next prime is 1434350417. The reversal of 1434350411 is 1140534341.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1434350411 - 26 = 1434350347 is a prime.
It is a super-2 number, since 2×14343504112 = 4114722203071737842, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1434350417) 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 in 7 ways as a sum of consecutive naturals, for example, 1901945 + ... + 1902698.
It is an arithmetic number, because the mean of its divisors is an integer number (199743810).
Almost surely, 21434350411 is an apocalyptic number.
1434350411 is a deficient number, since it is larger than the sum of its proper divisors (163600069).
1434350411 is a wasteful number, since it uses less digits than its factorization.
1434350411 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3804685.
The product of its (nonzero) digits is 2880, while the sum is 26.
The square root of 1434350411 is about 37872.8188942941. The cubic root of 1434350411 is about 1127.7645027864.
Adding to 1434350411 its reverse (1140534341), we get a palindrome (2574884752).
The spelling of 1434350411 in words is "one billion, four hundred thirty-four million, three hundred fifty thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •