Base | Representation |
---|---|
bin | 1001111101111001… |
… | …1110011000110000 |
3 | 20220110112211201210 |
4 | 2133132132120300 |
5 | 20434421104003 |
6 | 1121254400120 |
7 | 123205636224 |
oct | 23736363060 |
9 | 6813484653 |
10 | 2675566128 |
11 | 1153318484 |
12 | 628060040 |
13 | 338410131 |
14 | 1b54b2784 |
15 | 109d5a503 |
hex | 9f79e630 |
2675566128 has 40 divisors (see below), whose sum is σ = 6913843200. Its totient is φ = 891601984.
The previous prime is 2675566123. The next prime is 2675566169. The reversal of 2675566128 is 8216655762.
It is a happy number.
It is a hoax number, since the sum of its digits (48) coincides with the sum of the digits of its distinct prime factors.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is not an unprimeable number, because it can be changed into a prime (2675566121) 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, 248113 + ... + 258671.
It is an arithmetic number, because the mean of its divisors is an integer number (172846080).
Almost surely, 22675566128 is an apocalyptic number.
It is an amenable number.
2675566128 is an abundant number, since it is smaller than the sum of its proper divisors (4238277072).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2675566128 is a wasteful number, since it uses less digits than its factorization.
2675566128 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15849 (or 15843 counting only the distinct ones).
The product of its digits is 1209600, while the sum is 48.
The square root of 2675566128 is about 51725.8748403543. The cubic root of 2675566128 is about 1388.2634712606.
2675566128 divided by its sum of digits (48) gives a triangular number (55740961 = T10558).
The spelling of 2675566128 in words is "two billion, six hundred seventy-five million, five hundred sixty-six thousand, one hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •