Base | Representation |
---|---|
bin | 10000000011000… |
… | …10010100010001 |
3 | 100101022102111222 |
4 | 20001202110101 |
5 | 233430323213 |
6 | 21205214425 |
7 | 3223153253 |
oct | 1001422421 |
9 | 311272458 |
10 | 134620433 |
11 | 69a98362 |
12 | 39101415 |
13 | 21b7587c |
14 | 13c43cd3 |
15 | bc42808 |
hex | 8062511 |
134620433 has 8 divisors (see below), whose sum is σ = 142949448. Its totient is φ = 126337024.
The previous prime is 134620397. The next prime is 134620441. The reversal of 134620433 is 334026431.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 60109009 + 74511424 = 7753^2 + 8632^2 .
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 134620433 - 210 = 134619409 is a prime.
It is a super-2 number, since 2×1346204332 = 36245321962214978, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (134620463) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5216 + ... + 17217.
It is an arithmetic number, because the mean of its divisors is an integer number (17868681).
Almost surely, 2134620433 is an apocalyptic number.
It is an amenable number.
134620433 is a deficient number, since it is larger than the sum of its proper divisors (8329015).
134620433 is a wasteful number, since it uses less digits than its factorization.
134620433 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 22803.
The product of its (nonzero) digits is 5184, while the sum is 26.
The square root of 134620433 is about 11602.6045782833. The cubic root of 134620433 is about 512.5115546076.
Adding to 134620433 its reverse (334026431), we get a palindrome (468646864).
The spelling of 134620433 in words is "one hundred thirty-four million, six hundred twenty thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •