Base | Representation |
---|---|
bin | 11110110010010100100… |
… | …010110001100101100001 |
3 | 21111020202220211220120101 |
4 | 132302110202301211201 |
5 | 234130240202203401 |
6 | 4255522310142401 |
7 | 305563636513441 |
oct | 36622442614541 |
9 | 7436686756511 |
10 | 2115616053601 |
11 | 746256121106 |
12 | 2a202b651a01 |
13 | 12466a4197cb |
14 | 7457989a121 |
15 | 3a07316b101 |
hex | 1ec948b1961 |
2115616053601 has 4 divisors (see below), whose sum is σ = 2240064056772. Its totient is φ = 1991168050432.
The previous prime is 2115616053553. The next prime is 2115616053611. The reversal of 2115616053601 is 1063506165112.
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 1147792965201 + 967823088400 = 1071351^2 + 983780^2 .
It is a cyclic number.
It is not a de Polignac number, because 2115616053601 - 223 = 2115607664993 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2115616053611) 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 3 ways as a sum of consecutive naturals, for example, 62224001560 + ... + 62224001593.
It is an arithmetic number, because the mean of its divisors is an integer number (560016014193).
Almost surely, 22115616053601 is an apocalyptic number.
It is an amenable number.
2115616053601 is a deficient number, since it is larger than the sum of its proper divisors (124448003171).
2115616053601 is a wasteful number, since it uses less digits than its factorization.
2115616053601 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 124448003170.
The product of its (nonzero) digits is 32400, while the sum is 37.
The spelling of 2115616053601 in words is "two trillion, one hundred fifteen billion, six hundred sixteen million, fifty-three thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •