Base | Representation |
---|---|
bin | 100011001010001111… |
… | …1011100101100100000 |
3 | 21012220010022210101000 |
4 | 1012110133130230200 |
5 | 2214113430403000 |
6 | 54404205312000 |
7 | 5312046665541 |
oct | 1062437345440 |
9 | 235803283330 |
10 | 75505716000 |
11 | 2a02700aa90 |
12 | 12772865600 |
13 | 7173cacc80 |
14 | 3923d1a4c8 |
15 | 1e6db5e000 |
hex | 11947dcb20 |
75505716000 has 768 divisors, whose sum is σ = 322955942400. Its totient is φ = 16892928000.
The previous prime is 75505715983. The next prime is 75505716043. The reversal of 75505716000 is 61750557.
It is a super-2 number, since 2×755057160002 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
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 127 ways as a sum of consecutive naturals, for example, 15441556 + ... + 15446444.
It is an arithmetic number, because the mean of its divisors is an integer number (420515550).
Almost surely, 275505716000 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 75505716000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (161477971200).
75505716000 is an abundant number, since it is smaller than the sum of its proper divisors (247450226400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
75505716000 is a wasteful number, since it uses less digits than its factorization.
75505716000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4947 (or 4923 counting only the distinct ones).
The product of its (nonzero) digits is 36750, while the sum is 36.
The spelling of 75505716000 in words is "seventy-five billion, five hundred five million, seven hundred sixteen thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •