Base | Representation |
---|---|
bin | 1001000010111… |
… | …00001001010101 |
3 | 12021202211210112 |
4 | 10201130021111 |
5 | 123410444101 |
6 | 11310132405 |
7 | 1610632424 |
oct | 441341125 |
9 | 167684715 |
10 | 75874901 |
11 | 39913a33 |
12 | 214b1105 |
13 | 129478bb |
14 | a1112bb |
15 | 69db6bb |
hex | 485c255 |
75874901 has 8 divisors (see below), whose sum is σ = 78183480. Its totient is φ = 73579968.
The previous prime is 75874889. The next prime is 75874913. The reversal of 75874901 is 10947857.
It is an interprime number because it is at equal distance from previous prime (75874889) and next prime (75874913).
It can be written as a sum of positive squares in 4 ways, for example, as 358801 + 75516100 = 599^2 + 8690^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 75874901 - 26 = 75874837 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (75874951) 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 7 ways as a sum of consecutive naturals, for example, 8495 + ... + 14963.
It is an arithmetic number, because the mean of its divisors is an integer number (9772935).
Almost surely, 275874901 is an apocalyptic number.
It is an amenable number.
75874901 is a deficient number, since it is larger than the sum of its proper divisors (2308579).
75874901 is a wasteful number, since it uses less digits than its factorization.
75874901 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6823.
The product of its (nonzero) digits is 70560, while the sum is 41.
The square root of 75874901 is about 8710.6200123757. The cubic root of 75874901 is about 423.3498196954.
The spelling of 75874901 in words is "seventy-five million, eight hundred seventy-four thousand, nine hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •