Base | Representation |
---|---|
bin | 10000000000000… |
… | …01011001001001 |
3 | 100100120020221021 |
4 | 20000001121021 |
5 | 233330122213 |
6 | 21152512441 |
7 | 3216610651 |
oct | 1000013111 |
9 | 310506837 |
10 | 134223433 |
11 | 69847063 |
12 | 38b4b721 |
13 | 21a66c66 |
14 | 13b7d361 |
15 | bbb4d8d |
hex | 8001649 |
134223433 has 2 divisors, whose sum is σ = 134223434. Its totient is φ = 134223432.
The previous prime is 134223431. The next prime is 134223437. The reversal of 134223433 is 334322431.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 82210489 + 52012944 = 9067^2 + 7212^2 .
It is a cyclic number.
It is not a de Polignac number, because 134223433 - 21 = 134223431 is a prime.
Together with 134223431, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 134223398 and 134223407.
It is not a weakly prime, because it can be changed into another prime (134223431) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 67111716 + 67111717.
It is an arithmetic number, because the mean of its divisors is an integer number (67111717).
Almost surely, 2134223433 is an apocalyptic number.
It is an amenable number.
134223433 is a deficient number, since it is larger than the sum of its proper divisors (1).
134223433 is an equidigital number, since it uses as much as digits as its factorization.
134223433 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 5184, while the sum is 25.
The square root of 134223433 is about 11585.4837188613. The cubic root of 134223433 is about 512.0072541799.
Adding to 134223433 its reverse (334322431), we get a palindrome (468545864).
The spelling of 134223433 in words is "one hundred thirty-four million, two hundred twenty-three thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •