Base | Representation |
---|---|
bin | 110110111001001101001000… |
… | …110010000011100111101001 |
3 | 1011122211001202002200210221011 |
4 | 312321031020302003213221 |
5 | 223121004141201211113 |
6 | 2213245222520143521 |
7 | 101565266055356236 |
oct | 6671151062034751 |
9 | 1148731662623834 |
10 | 241425627757033 |
11 | 6aa20040a088a5 |
12 | 230b1aa2307ba1 |
13 | a493453a60685 |
14 | 43890c41c278d |
15 | 1cda07bc9063d |
hex | db9348c839e9 |
241425627757033 has 2 divisors, whose sum is σ = 241425627757034. Its totient is φ = 241425627757032.
The previous prime is 241425627756983. The next prime is 241425627757079. The reversal of 241425627757033 is 330757726524142.
241425627757033 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 137755924880809 + 103669702876224 = 11736947^2 + 10181832^2 .
It is a cyclic number.
It is not a de Polignac number, because 241425627757033 - 213 = 241425627748841 is a prime.
It is not a weakly prime, because it can be changed into another prime (241425697757033) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 120712813878516 + 120712813878517.
It is an arithmetic number, because the mean of its divisors is an integer number (120712813878517).
Almost surely, 2241425627757033 is an apocalyptic number.
It is an amenable number.
241425627757033 is a deficient number, since it is larger than the sum of its proper divisors (1).
241425627757033 is an equidigital number, since it uses as much as digits as its factorization.
241425627757033 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 59270400, while the sum is 58.
The spelling of 241425627757033 in words is "two hundred forty-one trillion, four hundred twenty-five billion, six hundred twenty-seven million, seven hundred fifty-seven thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •