Base | Representation |
---|---|
bin | 1001000101111… |
… | …10000100100001 |
3 | 12022112020000002 |
4 | 10202332010201 |
5 | 124011313001 |
6 | 11322505345 |
7 | 1614223004 |
oct | 442760441 |
9 | 168466002 |
10 | 76276001 |
11 | 3a06831a |
12 | 21665255 |
13 | 12a58339 |
14 | a1b753b |
15 | 6a6a46b |
hex | 48be121 |
76276001 has 4 divisors (see below), whose sum is σ = 77241600. Its totient is φ = 75310404.
The previous prime is 76275977. The next prime is 76276019. The reversal of 76276001 is 10067267.
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: 10067267 = 7 ⋅1438181.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-76276001 is a prime.
It is a super-4 number, since 4×762760014 (a number of 33 digits) contains 4444 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (76276091) 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, 482681 + ... + 482838.
It is an arithmetic number, because the mean of its divisors is an integer number (19310400).
Almost surely, 276276001 is an apocalyptic number.
It is an amenable number.
76276001 is a deficient number, since it is larger than the sum of its proper divisors (965599).
76276001 is an equidigital number, since it uses as much as digits as its factorization.
76276001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 965598.
The product of its (nonzero) digits is 3528, while the sum is 29.
The square root of 76276001 is about 8733.6132843171. The cubic root of 76276001 is about 424.0944984133.
The spelling of 76276001 in words is "seventy-six million, two hundred seventy-six thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •