Base | Representation |
---|---|
bin | 1001000111011… |
… | …01101110111110 |
3 | 12022220010210210 |
4 | 10203231232332 |
5 | 124034034410 |
6 | 11331013250 |
7 | 1615665123 |
oct | 443555676 |
9 | 168803723 |
10 | 76471230 |
11 | 3a190a70 |
12 | 2173a226 |
13 | 12ac6164 |
14 | a22874a |
15 | 6aa8220 |
hex | 48edbbe |
76471230 has 64 divisors (see below), whose sum is σ = 205659648. Its totient is φ = 18034560.
The previous prime is 76471229. The next prime is 76471237. The reversal of 76471230 is 3217467.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (76471237) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 9079 + ... + 15341.
It is an arithmetic number, because the mean of its divisors is an integer number (3213432).
Almost surely, 276471230 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 76471230, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (102829824).
76471230 is an abundant number, since it is smaller than the sum of its proper divisors (129188418).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
76471230 is a wasteful number, since it uses less digits than its factorization.
76471230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6321.
The product of its (nonzero) digits is 7056, while the sum is 30.
The square root of 76471230 is about 8744.7830161760. The cubic root of 76471230 is about 424.4560145102.
Adding to 76471230 its reverse (3217467), we get a palindrome (79688697).
The spelling of 76471230 in words is "seventy-six million, four hundred seventy-one thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •