Base | Representation |
---|---|
bin | 1001000000101… |
… | …10101100000001 |
3 | 12021020101112111 |
4 | 10200112230001 |
5 | 123322343101 |
6 | 11300055321 |
7 | 1605336115 |
oct | 440265401 |
9 | 167211474 |
10 | 75590401 |
11 | 3973a207 |
12 | 21394541 |
13 | 12878263 |
14 | a079745 |
15 | 6982251 |
hex | 4816b01 |
75590401 has 4 divisors (see below), whose sum is σ = 75607812. Its totient is φ = 75572992.
The previous prime is 75590399. The next prime is 75590441. The reversal of 75590401 is 10409557.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length, and also an emirpimes, since its reverse is a distinct semiprime: 10409557 = 383 ⋅27179.
It can be written as a sum of positive squares in 2 ways, for example, as 22810176 + 52780225 = 4776^2 + 7265^2 .
It is a cyclic number.
It is not a de Polignac number, because 75590401 - 21 = 75590399 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (75590441) 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, 3705 + ... + 12841.
It is an arithmetic number, because the mean of its divisors is an integer number (18901953).
Almost surely, 275590401 is an apocalyptic number.
It is an amenable number.
75590401 is a deficient number, since it is larger than the sum of its proper divisors (17411).
75590401 is an equidigital number, since it uses as much as digits as its factorization.
75590401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17410.
The product of its (nonzero) digits is 6300, while the sum is 31.
The square root of 75590401 is about 8694.2740352487. The cubic root of 75590401 is about 422.8200271292.
Adding to 75590401 its reverse (10409557), we get a palindrome (85999958).
The spelling of 75590401 in words is "seventy-five million, five hundred ninety thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •