Base | Representation |
---|---|
bin | 10000001110101… |
… | …11000111101001 |
3 | 100111012000011112 |
4 | 20013113013221 |
5 | 234323204213 |
6 | 21302040105 |
7 | 3242143202 |
oct | 1007270751 |
9 | 314160145 |
10 | 136147433 |
11 | 6a940644 |
12 | 39719035 |
13 | 2228b916 |
14 | 141205a9 |
15 | be44ea8 |
hex | 81d71e9 |
136147433 has 2 divisors, whose sum is σ = 136147434. Its totient is φ = 136147432.
The previous prime is 136147321. The next prime is 136147447. The reversal of 136147433 is 334741631.
136147433 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 134629609 + 1517824 = 11603^2 + 1232^2 .
It is a cyclic number.
It is not a de Polignac number, because 136147433 - 28 = 136147177 is a prime.
It is a super-2 number, since 2×1361474332 = 37072247024978978, which contains 22 as substring.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 136147433.
It is not a weakly prime, because it can be changed into another prime (136147493) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 68073716 + 68073717.
It is an arithmetic number, because the mean of its divisors is an integer number (68073717).
Almost surely, 2136147433 is an apocalyptic number.
It is an amenable number.
136147433 is a deficient number, since it is larger than the sum of its proper divisors (1).
136147433 is an equidigital number, since it uses as much as digits as its factorization.
136147433 is an evil number, because the sum of its binary digits is even.
The product of its digits is 18144, while the sum is 32.
The square root of 136147433 is about 11668.2232152115. The cubic root of 136147433 is about 514.4420803152.
The spelling of 136147433 in words is "one hundred thirty-six million, one hundred forty-seven thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •