Base | Representation |
---|---|
bin | 11110101001000000011… |
… | …000111010111000010101 |
3 | 21110021221212200121200012 |
4 | 132221000120322320111 |
5 | 233444244221440433 |
6 | 4251150020530005 |
7 | 305061040545626 |
oct | 36510030727025 |
9 | 7407855617605 |
10 | 2105614249493 |
11 | 741a933946a7 |
12 | 2a00b9b50905 |
13 | 12373524a121 |
14 | 73cab3c7a4d |
15 | 39b8a053848 |
hex | 1ea4063ae15 |
2105614249493 has 2 divisors, whose sum is σ = 2105614249494. Its totient is φ = 2105614249492.
The previous prime is 2105614249483. The next prime is 2105614249511. The reversal of 2105614249493 is 3949424165012.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1677110471089 + 428503778404 = 1295033^2 + 654602^2 .
It is a cyclic number.
It is not a de Polignac number, because 2105614249493 - 26 = 2105614249429 is a prime.
It is a super-2 number, since 2×21056142494932 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2105614249483) 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 as a sum of consecutive naturals, namely, 1052807124746 + 1052807124747.
It is an arithmetic number, because the mean of its divisors is an integer number (1052807124747).
Almost surely, 22105614249493 is an apocalyptic number.
It is an amenable number.
2105614249493 is a deficient number, since it is larger than the sum of its proper divisors (1).
2105614249493 is an equidigital number, since it uses as much as digits as its factorization.
2105614249493 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1866240, while the sum is 50.
The spelling of 2105614249493 in words is "two trillion, one hundred five billion, six hundred fourteen million, two hundred forty-nine thousand, four hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •