Base | Representation |
---|---|
bin | 100010111100110100… |
… | …0010100000011010001 |
3 | 21011201201022211202222 |
4 | 1011321220110003101 |
5 | 2212203043230212 |
6 | 54251350150425 |
7 | 5264635304333 |
oct | 1057150240321 |
9 | 234651284688 |
10 | 75055055057 |
11 | 29915692824 |
12 | 12667952415 |
13 | 71018114a8 |
14 | 38c0129453 |
15 | 1e442dec72 |
hex | 1179a140d1 |
75055055057 has 4 divisors (see below), whose sum is σ = 75798174516. Its totient is φ = 74311935600.
The previous prime is 75055055039. The next prime is 75055055069.
75055055057 is nontrivially palindromic in base 10.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 55022615761 + 20032439296 = 234569^2 + 141536^2 .
It is a cyclic number.
It is not a de Polignac number, because 75055055057 - 28 = 75055054801 is a prime.
It is a super-2 number, since 2×750550550572 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 75055054999 and 75055055017.
It is not an unprimeable number, because it can be changed into a prime (75055055087) 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, 371559578 + ... + 371559779.
It is an arithmetic number, because the mean of its divisors is an integer number (18949543629).
Almost surely, 275055055057 is an apocalyptic number.
It is an amenable number.
75055055057 is a deficient number, since it is larger than the sum of its proper divisors (743119459).
75055055057 is a wasteful number, since it uses less digits than its factorization.
75055055057 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 743119458.
The product of its (nonzero) digits is 765625, while the sum is 44.
The spelling of 75055055057 in words is "seventy-five billion, fifty-five million, fifty-five thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •