Base | Representation |
---|---|
bin | 1000111100101… |
… | …00100011011001 |
3 | 12020020022100120 |
4 | 10132110203121 |
5 | 123203313434 |
6 | 11240423453 |
7 | 1600656102 |
oct | 436244331 |
9 | 166208316 |
10 | 75057369 |
11 | 39405792 |
12 | 21177b89 |
13 | 1271c75a |
14 | 9d7b3a9 |
15 | 68c9349 |
hex | 47948d9 |
75057369 has 4 divisors (see below), whose sum is σ = 100076496. Its totient is φ = 50038244.
The previous prime is 75057361. The next prime is 75057373. The reversal of 75057369 is 96375057.
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 75057369 - 23 = 75057361 is a prime.
It is a super-2 number, since 2×750573692 = 11267217282404322, which contains 22 as substring.
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 75057369.
It is not an unprimeable number, because it can be changed into a prime (75057361) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 12509559 + ... + 12509564.
It is an arithmetic number, because the mean of its divisors is an integer number (25019124).
Almost surely, 275057369 is an apocalyptic number.
It is an amenable number.
75057369 is a deficient number, since it is larger than the sum of its proper divisors (25019127).
75057369 is a wasteful number, since it uses less digits than its factorization.
75057369 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25019126.
The product of its (nonzero) digits is 198450, while the sum is 42.
The square root of 75057369 is about 8663.5656054537. The cubic root of 75057369 is about 421.8238316652.
The spelling of 75057369 in words is "seventy-five million, fifty-seven thousand, three hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •