Base | Representation |
---|---|
bin | 1111011111000101001111… |
… | …00001001111000111101001 |
3 | 11110120110112210212120021121 |
4 | 13233202213201033013221 |
5 | 13430412140133333231 |
6 | 200231513013535241 |
7 | 10113161540363206 |
oct | 757424741170751 |
9 | 143513483776247 |
10 | 34053311230441 |
11 | a939a23470158 |
12 | 399b915044521 |
13 | 16002a0cbc649 |
14 | 85a290abacad |
15 | 3e0c11199311 |
hex | 1ef8a784f1e9 |
34053311230441 has 2 divisors, whose sum is σ = 34053311230442. Its totient is φ = 34053311230440.
The previous prime is 34053311230369. The next prime is 34053311230447. The reversal of 34053311230441 is 14403211335043.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 21800308046400 + 12253003184041 = 4669080^2 + 3500429^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-34053311230441 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 34053311230397 and 34053311230406.
It is not a weakly prime, because it can be changed into another prime (34053311230447) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 17026655615220 + 17026655615221.
It is an arithmetic number, because the mean of its divisors is an integer number (17026655615221).
Almost surely, 234053311230441 is an apocalyptic number.
It is an amenable number.
34053311230441 is a deficient number, since it is larger than the sum of its proper divisors (1).
34053311230441 is an equidigital number, since it uses as much as digits as its factorization.
34053311230441 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 51840, while the sum is 34.
Adding to 34053311230441 its reverse (14403211335043), we get a palindrome (48456522565484).
The spelling of 34053311230441 in words is "thirty-four trillion, fifty-three billion, three hundred eleven million, two hundred thirty thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •