Base | Representation |
---|---|
bin | 1001000101111… |
… | …11001011111000 |
3 | 12022112110021020 |
4 | 10202333023320 |
5 | 124011434233 |
6 | 11322542440 |
7 | 1614242220 |
oct | 442771370 |
9 | 168473236 |
10 | 76280568 |
11 | 3a0707a1 |
12 | 21667a20 |
13 | 12a5a440 |
14 | a1b9080 |
15 | 6a6b9b3 |
hex | 48bf2f8 |
76280568 has 128 divisors (see below), whose sum is σ = 239500800. Its totient is φ = 19708416.
The previous prime is 76280563. The next prime is 76280579. The reversal of 76280568 is 86508267.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (76280563) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 115423 + ... + 116081.
It is an arithmetic number, because the mean of its divisors is an integer number (1871100).
Almost surely, 276280568 is an apocalyptic number.
76280568 is a gapful number since it is divisible by the number (78) 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 76280568, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (119750400).
76280568 is an abundant number, since it is smaller than the sum of its proper divisors (163220232).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
76280568 is a wasteful number, since it uses less digits than its factorization.
76280568 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 741 (or 737 counting only the distinct ones).
The product of its (nonzero) digits is 161280, while the sum is 42.
The square root of 76280568 is about 8733.8747414879. The cubic root of 76280568 is about 424.1029624164.
The spelling of 76280568 in words is "seventy-six million, two hundred eighty thousand, five hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.106 sec. • engine limits •