Base | Representation |
---|---|
bin | 1000111101110… |
… | …01001111111000 |
3 | 12020111221112100 |
4 | 10132321033320 |
5 | 123223121142 |
6 | 11243543400 |
7 | 1602153231 |
oct | 436711770 |
9 | 166457470 |
10 | 75207672 |
11 | 394a8701 |
12 | 2122ab60 |
13 | 12772ca7 |
14 | 9dba088 |
15 | 6908b4c |
hex | 47b93f8 |
75207672 has 96 divisors (see below), whose sum is σ = 212940000. Its totient is φ = 23950080.
The previous prime is 75207659. The next prime is 75207679. The reversal of 75207672 is 27670257.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (75207679) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 377829 + ... + 378027.
It is an arithmetic number, because the mean of its divisors is an integer number (2218125).
Almost surely, 275207672 is an apocalyptic number.
75207672 is a gapful number since it is divisible by the number (72) 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 75207672, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (106470000).
75207672 is an abundant number, since it is smaller than the sum of its proper divisors (137732328).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
75207672 is a wasteful number, since it uses less digits than its factorization.
75207672 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 421 (or 414 counting only the distinct ones).
The product of its (nonzero) digits is 41160, while the sum is 36.
The square root of 75207672 is about 8672.2356979040. The cubic root of 75207672 is about 422.1052124927.
The spelling of 75207672 in words is "seventy-five million, two hundred seven thousand, six hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •