Base | Representation |
---|---|
bin | 111110100000000100… |
… | …1011110000000111001 |
3 | 110211110001000010201112 |
4 | 1331000021132000321 |
5 | 4144340333211413 |
6 | 141354312530105 |
7 | 12461046651164 |
oct | 1750011360071 |
9 | 424401003645 |
10 | 134220210233 |
11 | 51a1689a58a |
12 | 2201a0b0935 |
13 | c870308555 |
14 | 66d3b82adb |
15 | 37585d62a8 |
hex | 1f4025e039 |
134220210233 has 2 divisors, whose sum is σ = 134220210234. Its totient is φ = 134220210232.
The previous prime is 134220210227. The next prime is 134220210239. The reversal of 134220210233 is 332012022431.
It is a balanced prime because it is at equal distance from previous prime (134220210227) and next prime (134220210239).
It can be written as a sum of positive squares in only one way, i.e., 100230494464 + 33989715769 = 316592^2 + 184363^2 .
It is a cyclic number.
It is not a de Polignac number, because 134220210233 - 24 = 134220210217 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 134220210199 and 134220210208.
It is not a weakly prime, because it can be changed into another prime (134220210239) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 67110105116 + 67110105117.
It is an arithmetic number, because the mean of its divisors is an integer number (67110105117).
Almost surely, 2134220210233 is an apocalyptic number.
It is an amenable number.
134220210233 is a deficient number, since it is larger than the sum of its proper divisors (1).
134220210233 is an equidigital number, since it uses as much as digits as its factorization.
134220210233 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1728, while the sum is 23.
Adding to 134220210233 its reverse (332012022431), we get a palindrome (466232232664).
The spelling of 134220210233 in words is "one hundred thirty-four billion, two hundred twenty million, two hundred ten thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •