Base | Representation |
---|---|
bin | 1000111101011… |
… | …00101010000000 |
3 | 12020102022210010 |
4 | 10132230222000 |
5 | 123214443341 |
6 | 11242504520 |
7 | 1601546661 |
oct | 436545200 |
9 | 166368703 |
10 | 75156096 |
11 | 39472984 |
12 | 21205140 |
13 | 12755682 |
14 | 9da5368 |
15 | 68e8716 |
hex | 47aca80 |
75156096 has 64 divisors (see below), whose sum is σ = 210160800. Its totient is φ = 23731200.
The previous prime is 75156089. The next prime is 75156101. The reversal of 75156096 is 69065157.
It is a tau number, because it is divible by the number of its divisors (64).
It is a super-2 number, since 2×751560962 = 11296877531922432, which contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2146 + ... + 12446.
Almost surely, 275156096 is an apocalyptic number.
75156096 is a gapful number since it is divisible by the number (76) 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 75156096, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (105080400).
75156096 is an abundant number, since it is smaller than the sum of its proper divisors (135004704).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
75156096 is a wasteful number, since it uses less digits than its factorization.
75156096 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10337 (or 10325 counting only the distinct ones).
The product of its (nonzero) digits is 56700, while the sum is 39.
The square root of 75156096 is about 8669.2615602484. The cubic root of 75156096 is about 422.0086998349.
The spelling of 75156096 in words is "seventy-five million, one hundred fifty-six thousand, ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •