Base | Representation |
---|---|
bin | 1111100100010000011010… |
… | …01101111101101000010001 |
3 | 11111012110110222201110002202 |
4 | 13302020031031331220101 |
5 | 13441320303421110413 |
6 | 200445315542252545 |
7 | 10132054562425346 |
oct | 762101515755021 |
9 | 144173428643082 |
10 | 34231111113233 |
11 | a9a8372902751 |
12 | 3a0a275a27155 |
13 | 1613c97b91098 |
14 | 864b1a6087cd |
15 | 3e566a660e58 |
hex | 1f220d37da11 |
34231111113233 has 2 divisors, whose sum is σ = 34231111113234. Its totient is φ = 34231111113232.
The previous prime is 34231111113193. The next prime is 34231111113257. The reversal of 34231111113233 is 33231111113243.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 26594576802049 + 7636534311184 = 5156993^2 + 2763428^2 .
It is a cyclic number.
It is not a de Polignac number, because 34231111113233 - 226 = 34231044004369 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 34231111113196 and 34231111113205.
It is not a weakly prime, because it can be changed into another prime (34231111113293) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 17115555556616 + 17115555556617.
It is an arithmetic number, because the mean of its divisors is an integer number (17115555556617).
Almost surely, 234231111113233 is an apocalyptic number.
It is an amenable number.
34231111113233 is a deficient number, since it is larger than the sum of its proper divisors (1).
34231111113233 is an equidigital number, since it uses as much as digits as its factorization.
34231111113233 is an evil number, because the sum of its binary digits is even.
The product of its digits is 3888, while the sum is 29.
Adding to 34231111113233 its reverse (33231111113243), we get a palindrome (67462222226476).
The spelling of 34231111113233 in words is "thirty-four trillion, two hundred thirty-one billion, one hundred eleven million, one hundred thirteen thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.035 sec. • engine limits •