Base | Representation |
---|---|
bin | 111110100111101010101001… |
… | …001110011000110011101001 |
3 | 1100010010102202022011122122222 |
4 | 332213222221032120303221 |
5 | 242044212342402401431 |
6 | 2413423104242323425 |
7 | 112003222666522526 |
oct | 7647525116306351 |
9 | 1303112668148588 |
10 | 275404732075241 |
11 | 7a83054451950a |
12 | 26a7b347659575 |
13 | ba89729b796a2 |
14 | 4c0193567214d |
15 | 21c8d9833157b |
hex | fa7aa9398ce9 |
275404732075241 has 8 divisors (see below), whose sum is σ = 282123846905544. Its totient is φ = 268685708970880.
The previous prime is 275404732075201. The next prime is 275404732075271. The reversal of 275404732075241 is 142570237404572.
It can be written as a sum of positive squares in 4 ways, for example, as 3935446569616 + 271469285505625 = 1983796^2 + 16476325^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-275404732075241 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (275404732075201) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 16833746 + ... + 28882251.
It is an arithmetic number, because the mean of its divisors is an integer number (35265480863193).
Almost surely, 2275404732075241 is an apocalyptic number.
It is an amenable number.
275404732075241 is a deficient number, since it is larger than the sum of its proper divisors (6719114830303).
275404732075241 is a wasteful number, since it uses less digits than its factorization.
275404732075241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45862971.
The product of its (nonzero) digits is 13171200, while the sum is 53.
The spelling of 275404732075241 in words is "two hundred seventy-five trillion, four hundred four billion, seven hundred thirty-two million, seventy-five thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •