Base | Representation |
---|---|
bin | 111110100000011111… |
… | …0100000000110110001 |
3 | 110211111000011102221211 |
4 | 1331000332200012301 |
5 | 4144402413044213 |
6 | 141355530520121 |
7 | 12461306062321 |
oct | 1750076400661 |
9 | 424430142854 |
10 | 134234112433 |
11 | 51a23725503 |
12 | 22022896041 |
13 | c8731652c5 |
14 | 66d5961281 |
15 | 375993053d |
hex | 1f40fa01b1 |
134234112433 has 2 divisors, whose sum is σ = 134234112434. Its totient is φ = 134234112432.
The previous prime is 134234112401. The next prime is 134234112449. The reversal of 134234112433 is 334211432431.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 82169369104 + 52064743329 = 286652^2 + 228177^2 .
It is a cyclic number.
It is not a de Polignac number, because 134234112433 - 25 = 134234112401 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 134234112395 and 134234112404.
It is not a weakly prime, because it can be changed into another prime (134234112473) 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, 67117056216 + 67117056217.
It is an arithmetic number, because the mean of its divisors is an integer number (67117056217).
Almost surely, 2134234112433 is an apocalyptic number.
It is an amenable number.
134234112433 is a deficient number, since it is larger than the sum of its proper divisors (1).
134234112433 is an equidigital number, since it uses as much as digits as its factorization.
134234112433 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 20736, while the sum is 31.
Adding to 134234112433 its reverse (334211432431), we get a palindrome (468445544864).
The spelling of 134234112433 in words is "one hundred thirty-four billion, two hundred thirty-four million, one hundred twelve thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •