Base | Representation |
---|---|
bin | 111111001010111101111… |
… | …110110100110010110001 |
3 | 120101000011000200010211012 |
4 | 333022331332310302301 |
5 | 1032111040202110303 |
6 | 13122135323400305 |
7 | 625430416664114 |
oct | 77127576646261 |
9 | 16330130603735 |
10 | 4341104331953 |
11 | 142406324a944 |
12 | 5a1403083095 |
13 | 25649771624c |
14 | 11017959857b |
15 | 77dc70905d8 |
hex | 3f2bdfb4cb1 |
4341104331953 has 2 divisors, whose sum is σ = 4341104331954. Its totient is φ = 4341104331952.
The previous prime is 4341104331913. The next prime is 4341104332031. The reversal of 4341104331953 is 3591334011434.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4145817232384 + 195287099569 = 2036128^2 + 441913^2 .
It is a cyclic number.
It is not a de Polignac number, because 4341104331953 - 228 = 4340835896497 is a prime.
It is a super-2 number, since 2×43411043319532 (a number of 26 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 4341104331953.
It is not a weakly prime, because it can be changed into another prime (4341104331913) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2170552165976 + 2170552165977.
It is an arithmetic number, because the mean of its divisors is an integer number (2170552165977).
Almost surely, 24341104331953 is an apocalyptic number.
It is an amenable number.
4341104331953 is a deficient number, since it is larger than the sum of its proper divisors (1).
4341104331953 is an equidigital number, since it uses as much as digits as its factorization.
4341104331953 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 233280, while the sum is 41.
The spelling of 4341104331953 in words is "four trillion, three hundred forty-one billion, one hundred four million, three hundred thirty-one thousand, nine hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •