Base | Representation |
---|---|
bin | 111011111110100010011… |
… | …010101111111101100101 |
3 | 112121000120021211110211102 |
4 | 323332202122233331211 |
5 | 1020012013212324203 |
6 | 12433234121045445 |
7 | 603530024461454 |
oct | 73764232577545 |
9 | 15530507743742 |
10 | 4121598558053 |
11 | 1349a61a33049 |
12 | 566963026885 |
13 | 23b885232432 |
14 | 1036b4ac2b9b |
15 | 7232b477888 |
hex | 3bfa26aff65 |
4121598558053 has 2 divisors, whose sum is σ = 4121598558054. Its totient is φ = 4121598558052.
The previous prime is 4121598558001. The next prime is 4121598558071. The reversal of 4121598558053 is 3508558951214.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2662568900644 + 1459029657409 = 1631738^2 + 1207903^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-4121598558053 is a prime.
It is a super-2 number, since 2×41215985580532 (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 4121598558053.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4121598558083) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2060799279026 + 2060799279027.
It is an arithmetic number, because the mean of its divisors is an integer number (2060799279027).
Almost surely, 24121598558053 is an apocalyptic number.
It is an amenable number.
4121598558053 is a deficient number, since it is larger than the sum of its proper divisors (1).
4121598558053 is an equidigital number, since it uses as much as digits as its factorization.
4121598558053 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8640000, while the sum is 56.
The spelling of 4121598558053 in words is "four trillion, one hundred twenty-one billion, five hundred ninety-eight million, five hundred fifty-eight thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •