Base | Representation |
---|---|
bin | 111001101001011111111010… |
… | …110100011100101001011101 |
3 | 1020020201020010222100020001211 |
4 | 321221133322310130221131 |
5 | 231213001241130044010 |
6 | 2255122510120104421 |
7 | 104255456011550401 |
oct | 7151377264345135 |
9 | 1206636128306054 |
10 | 253540422503005 |
11 | 73870986799390 |
12 | 245299ba605111 |
13 | ab619b4102141 |
14 | 46875c9a97101 |
15 | 1e4a27cbb908a |
hex | e697fad1ca5d |
253540422503005 has 8 divisors (see below), whose sum is σ = 331907462185824. Its totient is φ = 184393034547600.
The previous prime is 253540422502993. The next prime is 253540422503029. The reversal of 253540422503005 is 500305224045352.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 253540422503005 - 211 = 253540422500957 is a prime.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2304912931791 + ... + 2304912931900.
It is an arithmetic number, because the mean of its divisors is an integer number (41488432773228).
Almost surely, 2253540422503005 is an apocalyptic number.
It is an amenable number.
253540422503005 is a deficient number, since it is larger than the sum of its proper divisors (78367039682819).
253540422503005 is a wasteful number, since it uses less digits than its factorization.
253540422503005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4609825863707.
The product of its (nonzero) digits is 720000, while the sum is 40.
Adding to 253540422503005 its reverse (500305224045352), we get a palindrome (753845646548357).
The spelling of 253540422503005 in words is "two hundred fifty-three trillion, five hundred forty billion, four hundred twenty-two million, five hundred three thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •