Base | Representation |
---|---|
bin | 100011000010010110… |
… | …0101111001110001100 |
3 | 21012012122202211222002 |
4 | 1012010230233032030 |
5 | 2213043113424200 |
6 | 54322022411432 |
7 | 5302351641602 |
oct | 1060454571614 |
9 | 235178684862 |
10 | 75240764300 |
11 | 29a004a4939 |
12 | 126b9b90b78 |
13 | 7131133c10 |
14 | 38daa6b872 |
15 | 1e55774bd5 |
hex | 1184b2f38c |
75240764300 has 72 divisors (see below), whose sum is σ = 176665848912. Its totient is φ = 27649440000.
The previous prime is 75240764281. The next prime is 75240764329. The reversal of 75240764300 is 346704257.
It is a super-2 number, since 2×752407643002 (a number of 23 digits) contains 22 as substring.
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, 137150 + ... + 411450.
It is an arithmetic number, because the mean of its divisors is an integer number (2453692346).
Almost surely, 275240764300 is an apocalyptic number.
It is a pronic number, being equal to 274300×274301.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 75240764300, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (88332924456).
75240764300 is an abundant number, since it is smaller than the sum of its proper divisors (101425084612).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
75240764300 is a wasteful number, since it uses less digits than its factorization.
75240764300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 274539 (or 274532 counting only the distinct ones).
The product of its (nonzero) digits is 141120, while the sum is 38.
The spelling of 75240764300 in words is "seventy-five billion, two hundred forty million, seven hundred sixty-four thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •