Base | Representation |
---|---|
bin | 11111010101010000110… |
… | …011101010010001000001 |
3 | 21121211121122010002012122 |
4 | 133111100303222101001 |
5 | 240234104342210131 |
6 | 4325045233134025 |
7 | 311362450606244 |
oct | 37252063522101 |
9 | 7554548102178 |
10 | 2153134335041 |
11 | 760159222278 |
12 | 2a93603ba315 |
13 | 1280692a0a41 |
14 | 762d861525b |
15 | 3b01bd38d7b |
hex | 1f550cea441 |
2153134335041 has 32 divisors (see below), whose sum is σ = 2311182789120. Its totient is φ = 1999788134400.
The previous prime is 2153134335019. The next prime is 2153134335047. The reversal of 2153134335041 is 1405334313512.
It is a cyclic number.
It is not a de Polignac number, because 2153134335041 - 210 = 2153134334017 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2153134334992 and 2153134335010.
It is not an unprimeable number, because it can be changed into a prime (2153134335047) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1007548925 + ... + 1007551061.
It is an arithmetic number, because the mean of its divisors is an integer number (72224462160).
Almost surely, 22153134335041 is an apocalyptic number.
It is an amenable number.
2153134335041 is a deficient number, since it is larger than the sum of its proper divisors (158048454079).
2153134335041 is a wasteful number, since it uses less digits than its factorization.
2153134335041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4665.
The product of its (nonzero) digits is 64800, while the sum is 35.
Adding to 2153134335041 its reverse (1405334313512), we get a palindrome (3558468648553).
The spelling of 2153134335041 in words is "two trillion, one hundred fifty-three billion, one hundred thirty-four million, three hundred thirty-five thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •