Base | Representation |
---|---|
bin | 100110100100101000110… |
… | …110011001111001111110 |
3 | 100101101212110101101212120 |
4 | 212210220312121321332 |
5 | 321412043111002113 |
6 | 5345412231143410 |
7 | 362335216466034 |
oct | 46445066317176 |
9 | 10341773341776 |
10 | 2650680172158 |
11 | 932168943887 |
12 | 369877514b66 |
13 | 162c5bb4aa15 |
14 | 9241791a554 |
15 | 48e3c297a23 |
hex | 26928d99e7e |
2650680172158 has 32 divisors (see below), whose sum is σ = 5308081462656. Its totient is φ = 882440071968.
The previous prime is 2650680172157. The next prime is 2650680172163. The reversal of 2650680172158 is 8512710860562.
It is a super-2 number, since 2×26506801721582 (a number of 26 digits) contains 22 as substring.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 2650680172158.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2650680172157) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 77300485 + ... + 77334767.
It is an arithmetic number, because the mean of its divisors is an integer number (165877545708).
Almost surely, 22650680172158 is an apocalyptic number.
2650680172158 is an abundant number, since it is smaller than the sum of its proper divisors (2657401290498).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2650680172158 is a wasteful number, since it uses less digits than its factorization.
2650680172158 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50248.
The product of its (nonzero) digits is 1612800, while the sum is 51.
The spelling of 2650680172158 in words is "two trillion, six hundred fifty billion, six hundred eighty million, one hundred seventy-two thousand, one hundred fifty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •