Base | Representation |
---|---|
bin | 11111011101111000010… |
… | …100111101110101010101 |
3 | 21122201111111020000022101 |
4 | 133131320110331311111 |
5 | 240412032122440312 |
6 | 4333215332402101 |
7 | 312140654611315 |
oct | 37357024756525 |
9 | 7581444200271 |
10 | 2162387311957 |
11 | 76407729a834 |
12 | 2ab103176331 |
13 | 128bb2296702 |
14 | 7693547d445 |
15 | 3b3ae336a57 |
hex | 1f77853dd55 |
2162387311957 has 8 divisors (see below), whose sum is σ = 2166327361440. Its totient is φ = 2158447615440.
The previous prime is 2162387311943. The next prime is 2162387311963. The reversal of 2162387311957 is 7591137832612.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2162387311957 - 211 = 2162387309909 is a prime.
It is a super-3 number, since 3×21623873119573 (a number of 38 digits) contains 333 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2162387311898 and 2162387311907.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2162387311157) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 14304394 + ... + 14454772.
It is an arithmetic number, because the mean of its divisors is an integer number (270790920180).
Almost surely, 22162387311957 is an apocalyptic number.
It is an amenable number.
2162387311957 is a deficient number, since it is larger than the sum of its proper divisors (3940049483).
2162387311957 is a wasteful number, since it uses less digits than its factorization.
2162387311957 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 176483.
The product of its digits is 3810240, while the sum is 55.
The spelling of 2162387311957 in words is "two trillion, one hundred sixty-two billion, three hundred eighty-seven million, three hundred eleven thousand, nine hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •