Base | Representation |
---|---|
bin | 1001000011111… |
… | …11101110100001 |
3 | 12022001020201022 |
4 | 10201333232201 |
5 | 123430130031 |
6 | 11313215225 |
7 | 1612110344 |
oct | 441775641 |
9 | 168036638 |
10 | 76020641 |
11 | 39a03484 |
12 | 21561515 |
13 | 12999038 |
14 | a14c45b |
15 | 6a1997b |
hex | 487fba1 |
76020641 has 4 divisors (see below), whose sum is σ = 76110000. Its totient is φ = 75931284.
The previous prime is 76020631. The next prime is 76020647. The reversal of 76020641 is 14602067.
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, and also an emirpimes, since its reverse is a distinct semiprime: 14602067 = 521 ⋅28027.
It is a cyclic number.
It is not a de Polignac number, because 76020641 - 218 = 75758497 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 76020641.
It is not an unprimeable number, because it can be changed into a prime (76020647) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 43391 + ... + 45108.
It is an arithmetic number, because the mean of its divisors is an integer number (19027500).
Almost surely, 276020641 is an apocalyptic number.
It is an amenable number.
76020641 is a deficient number, since it is larger than the sum of its proper divisors (89359).
76020641 is an equidigital number, since it uses as much as digits as its factorization.
76020641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 89358.
The product of its (nonzero) digits is 2016, while the sum is 26.
The square root of 76020641 is about 8718.9816492524. The cubic root of 76020641 is about 423.6207021626.
Subtracting from 76020641 its sum of digits (26), we obtain a triangular number (76020615 = T12330).
The spelling of 76020641 in words is "seventy-six million, twenty thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •