Base | Representation |
---|---|
bin | 100011010011000011… |
… | …0001111110100100000 |
3 | 21020122201010211102120 |
4 | 1012212012033310200 |
5 | 2220220040141202 |
6 | 54453400344240 |
7 | 5322264500223 |
oct | 1064606176440 |
9 | 236581124376 |
10 | 75801099552 |
11 | 2a168821022 |
12 | 12835775080 |
13 | 71c0252739 |
14 | 395124b5ba |
15 | 1e89a5a0bc |
hex | 11a618fd20 |
75801099552 has 96 divisors (see below), whose sum is σ = 200445840000. Its totient is φ = 25081233408.
The previous prime is 75801099509. The next prime is 75801099559. The reversal of 75801099552 is 25599010857.
It is a tau number, because it is divible by the number of its divisors (96).
It is a junction number, because it is equal to n+sod(n) for n = 75801099495 and 75801099504.
It is not an unprimeable number, because it can be changed into a prime (75801099559) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 8573278 + ... + 8582114.
It is an arithmetic number, because the mean of its divisors is an integer number (2087977500).
Almost surely, 275801099552 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 75801099552, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (100222920000).
75801099552 is an abundant number, since it is smaller than the sum of its proper divisors (124644740448).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
75801099552 is a wasteful number, since it uses less digits than its factorization.
75801099552 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9498 (or 9490 counting only the distinct ones).
The product of its (nonzero) digits is 1134000, while the sum is 51.
The spelling of 75801099552 in words is "seventy-five billion, eight hundred one million, ninety-nine thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •