Base | Representation |
---|---|
bin | 11111100001101111110… |
… | …010001111001101101010 |
3 | 21200010012211021110120120 |
4 | 133201233302033031222 |
5 | 240444032433121144 |
6 | 4335143320504110 |
7 | 312345566200560 |
oct | 37415762171552 |
9 | 7603184243516 |
10 | 2166538957674 |
11 | 76590783a6a3 |
12 | 2aba8161b036 |
13 | 1293c4442100 |
14 | 76c0a9c9a30 |
15 | 3b553a63e19 |
hex | 1f86fc8f36a |
2166538957674 has 96 divisors (see below), whose sum is σ = 5367793618944. Its totient is φ = 570811775040.
The previous prime is 2166538957657. The next prime is 2166538957679. The reversal of 2166538957674 is 4767598356612.
It is a junction number, because it is equal to n+sod(n) for n = 2166538957599 and 2166538957608.
It is not an unprimeable number, because it can be changed into a prime (2166538957679) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 6822079 + ... + 7132589.
It is an arithmetic number, because the mean of its divisors is an integer number (55914516864).
Almost surely, 22166538957674 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2166538957674, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2683896809472).
2166538957674 is an abundant number, since it is smaller than the sum of its proper divisors (3201254661270).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2166538957674 is a wasteful number, since it uses less digits than its factorization.
2166538957674 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 311532 (or 311519 counting only the distinct ones).
The product of its digits is 457228800, while the sum is 69.
The spelling of 2166538957674 in words is "two trillion, one hundred sixty-six billion, five hundred thirty-eight million, nine hundred fifty-seven thousand, six hundred seventy-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •