Base | Representation |
---|---|
bin | 1001000100101… |
… | …00110100001101 |
3 | 12022012122012120 |
4 | 10202110310031 |
5 | 123440411041 |
6 | 11315123153 |
7 | 1612620234 |
oct | 442246415 |
9 | 168178176 |
10 | 76107021 |
11 | 39a62371 |
12 | 215a34b9 |
13 | 129c9453 |
14 | a171b1b |
15 | 6a35366 |
hex | 4894d0d |
76107021 has 4 divisors (see below), whose sum is σ = 101476032. Its totient is φ = 50738012.
The previous prime is 76107013. The next prime is 76107037. The reversal of 76107021 is 12070167.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 76107021 - 23 = 76107013 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 76106982 and 76107000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (76107071) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 12684501 + ... + 12684506.
It is an arithmetic number, because the mean of its divisors is an integer number (25369008).
Almost surely, 276107021 is an apocalyptic number.
It is an amenable number.
76107021 is a deficient number, since it is larger than the sum of its proper divisors (25369011).
76107021 is a wasteful number, since it uses less digits than its factorization.
76107021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25369010.
The product of its (nonzero) digits is 588, while the sum is 24.
The square root of 76107021 is about 8723.9338030501. The cubic root of 76107021 is about 423.7810906435.
Adding to 76107021 its reverse (12070167), we get a palindrome (88177188).
The spelling of 76107021 in words is "seventy-six million, one hundred seven thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •