Base | Representation |
---|---|
bin | 100111000100111110011… |
… | …101011001110010010110 |
3 | 100111201111022111010202020 |
4 | 213010332131121302112 |
5 | 322444201012031230 |
6 | 5413353514154010 |
7 | 365004530150640 |
oct | 47047635316226 |
9 | 10451438433666 |
10 | 2685402455190 |
11 | 94596674aa64 |
12 | 374547a22906 |
13 | 166303676220 |
14 | 93d8d1b3890 |
15 | 49cc076b810 |
hex | 2713e759c96 |
2685402455190 has 128 divisors (see below), whose sum is σ = 7933825428480. Its totient is φ = 566479001088.
The previous prime is 2685402455179. The next prime is 2685402455231. The reversal of 2685402455190 is 915542045862.
It is a super-2 number, since 2×26854024551902 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
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 63 ways as a sum of consecutive naturals, for example, 14175616 + ... + 14363804.
It is an arithmetic number, because the mean of its divisors is an integer number (61983011160).
Almost surely, 22685402455190 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2685402455190, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3966912714240).
2685402455190 is an abundant number, since it is smaller than the sum of its proper divisors (5248422973290).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2685402455190 is a wasteful number, since it uses less digits than its factorization.
2685402455190 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 193446.
The product of its (nonzero) digits is 3456000, while the sum is 51.
The spelling of 2685402455190 in words is "two trillion, six hundred eighty-five billion, four hundred two million, four hundred fifty-five thousand, one hundred ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •