Base | Representation |
---|---|
bin | 1001100000000110… |
… | …0111101101101000 |
3 | 20120202022221210221 |
4 | 2120001213231220 |
5 | 20210420433030 |
6 | 1101031215424 |
7 | 120130262524 |
oct | 23001475550 |
9 | 6522287727 |
10 | 2550561640 |
11 | 10997a8790 |
12 | 5b2217574 |
13 | 318553393 |
14 | 1a2a52d84 |
15 | eddb6e7a |
hex | 98067b68 |
2550561640 has 32 divisors (see below), whose sum is σ = 6260470560. Its totient is φ = 927476800.
The previous prime is 2550561631. The next prime is 2550561649. The reversal of 2550561640 is 461650552.
It is an interprime number because it is at equal distance from previous prime (2550561631) and next prime (2550561649).
It is a junction number, because it is equal to n+sod(n) for n = 2550561596 and 2550561605.
It is not an unprimeable number, because it can be changed into a prime (2550561649) 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, 2897926 + ... + 2898805.
It is an arithmetic number, because the mean of its divisors is an integer number (195639705).
Almost surely, 22550561640 is an apocalyptic number.
2550561640 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2550561640 is an abundant number, since it is smaller than the sum of its proper divisors (3709908920).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2550561640 is a wasteful number, since it uses less digits than its factorization.
2550561640 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5796753 (or 5796749 counting only the distinct ones).
The product of its (nonzero) digits is 36000, while the sum is 34.
The square root of 2550561640 is about 50503.0854502970. The cubic root of 2550561640 is about 1366.2975027758.
The spelling of 2550561640 in words is "two billion, five hundred fifty million, five hundred sixty-one thousand, six hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •