Base | Representation |
---|---|
bin | 11111010101010000010… |
… | …001101100011111001001 |
3 | 21121211121000100201111021 |
4 | 133111100101230133021 |
5 | 240234100102244431 |
6 | 4325044314232441 |
7 | 311362312123531 |
oct | 37252021543711 |
9 | 7554530321437 |
10 | 2153125431241 |
11 | 7601541a0764 |
12 | 2a9359425721 |
13 | 1280674a4115 |
14 | 762d73784c1 |
15 | 3b01b17ab11 |
hex | 1f55046c7c9 |
2153125431241 has 4 divisors (see below), whose sum is σ = 2154367859652. Its totient is φ = 2151883002832.
The previous prime is 2153125431239. The next prime is 2153125431271. The reversal of 2153125431241 is 1421345213512.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1490047455625 + 663077975616 = 1220675^2 + 814296^2 .
It is a cyclic number.
It is not a de Polignac number, because 2153125431241 - 21 = 2153125431239 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2153125431197 and 2153125431206.
It is not an unprimeable number, because it can be changed into a prime (2153125431271) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 621211606 + ... + 621215071.
It is an arithmetic number, because the mean of its divisors is an integer number (538591964913).
Almost surely, 22153125431241 is an apocalyptic number.
It is an amenable number.
2153125431241 is a deficient number, since it is larger than the sum of its proper divisors (1242428411).
2153125431241 is a wasteful number, since it uses less digits than its factorization.
2153125431241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1242428410.
The product of its digits is 28800, while the sum is 34.
The spelling of 2153125431241 in words is "two trillion, one hundred fifty-three billion, one hundred twenty-five million, four hundred thirty-one thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •