Base | Representation |
---|---|
bin | 1010111111010101… |
… | …0110111110110000 |
3 | 21121120221120000000 |
4 | 2233311112332300 |
5 | 22020200004220 |
6 | 1204420430000 |
7 | 133050406503 |
oct | 25765267660 |
9 | 7546846000 |
10 | 2950000560 |
11 | 12842200a1 |
12 | 6a3b48300 |
13 | 380229480 |
14 | 1ddb0d13a |
15 | 123eb9390 |
hex | afd56fb0 |
2950000560 has 320 divisors, whose sum is σ = 11086373760. Its totient is φ = 725594112.
The previous prime is 2950000523. The next prime is 2950000589. The reversal of 2950000560 is 650000592.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 2273832 + ... + 2275128.
It is an arithmetic number, because the mean of its divisors is an integer number (34644918).
Almost surely, 22950000560 is an apocalyptic number.
2950000560 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2950000560, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (5543186880).
2950000560 is an abundant number, since it is smaller than the sum of its proper divisors (8136373200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2950000560 is a wasteful number, since it uses less digits than its factorization.
2950000560 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1344 (or 1320 counting only the distinct ones).
The product of its (nonzero) digits is 2700, while the sum is 27.
The square root of 2950000560 is about 54313.9076112187. The cubic root of 2950000560 is about 1434.1922327683.
The spelling of 2950000560 in words is "two billion, nine hundred fifty million, five hundred sixty", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •