Base | Representation |
---|---|
bin | 1001001001010… |
… | …01101110010100 |
3 | 12100100121212110 |
4 | 10210221232110 |
5 | 124114420243 |
6 | 11340151020 |
7 | 1621040400 |
oct | 444515624 |
9 | 170317773 |
10 | 76716948 |
11 | 3a339640 |
12 | 21838470 |
13 | 12b80c59 |
14 | a290100 |
15 | 6b05e33 |
hex | 4929b94 |
76716948 has 144 divisors (see below), whose sum is σ = 235569600. Its totient is φ = 19192320.
The previous prime is 76716923. The next prime is 76716949. The reversal of 76716948 is 84961767.
It is a super-2 number, since 2×767169482 = 11770980220869408, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 76716897 and 76716906.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (76716949) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 187368 + ... + 187776.
It is an arithmetic number, because the mean of its divisors is an integer number (1635900).
Almost surely, 276716948 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 76716948, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (117784800).
76716948 is an abundant number, since it is smaller than the sum of its proper divisors (158852652).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
76716948 is a wasteful number, since it uses less digits than its factorization.
76716948 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 470 (or 461 counting only the distinct ones).
The product of its digits is 508032, while the sum is 48.
The square root of 76716948 is about 8758.8211535571. The cubic root of 76716948 is about 424.9101503256.
The spelling of 76716948 in words is "seventy-six million, seven hundred sixteen thousand, nine hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •