Base | Representation |
---|---|
bin | 1011001100011101… |
… | …1100111000111000 |
3 | 21202102120121221002 |
4 | 2303013130320320 |
5 | 22123244400000 |
6 | 1214105104132 |
7 | 134316500414 |
oct | 26307347070 |
9 | 7672517832 |
10 | 3005075000 |
11 | 1302317364 |
12 | 6ba488048 |
13 | 38b7704b5 |
14 | 207167d44 |
15 | 128c478d5 |
hex | b31dce38 |
3005075000 has 96 divisors (see below), whose sum is σ = 7146105120. Its totient is φ = 1184400000.
The previous prime is 3005074999. The next prime is 3005075027. The reversal of 3005075000 is 5705003.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1774154 + ... + 1775846.
It is an arithmetic number, because the mean of its divisors is an integer number (74438595).
Almost surely, 23005075000 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 3005075000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3573052560).
3005075000 is an abundant number, since it is smaller than the sum of its proper divisors (4141030120).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3005075000 is an equidigital number, since it uses as much as digits as its factorization.
3005075000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1795 (or 1771 counting only the distinct ones).
The product of its (nonzero) digits is 525, while the sum is 20.
The square root of 3005075000 is about 54818.5643737594. The cubic root of 3005075000 is about 1443.0623806525.
The spelling of 3005075000 in words is "three billion, five million, seventy-five thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •