Base | Representation |
---|---|
bin | 1110000011000110100… |
… | …1001000001100001101 |
3 | 212001222011112211200212 |
4 | 3200301221020030031 |
5 | 12423241331033423 |
6 | 302513010132205 |
7 | 23302621636214 |
oct | 3406151101415 |
9 | 761864484625 |
10 | 241351033613 |
11 | 933a1403848 |
12 | 3a937b81065 |
13 | 199b42673c1 |
14 | b977c9607b |
15 | 642887c578 |
hex | 3831a4830d |
241351033613 has 2 divisors, whose sum is σ = 241351033614. Its totient is φ = 241351033612.
The previous prime is 241351033549. The next prime is 241351033621. The reversal of 241351033613 is 316330153142.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 156228886564 + 85122147049 = 395258^2 + 291757^2 .
It is a cyclic number.
It is not a de Polignac number, because 241351033613 - 26 = 241351033549 is a prime.
It is a Sophie Germain prime.
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 241351033613.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (241351035613) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 120675516806 + 120675516807.
It is an arithmetic number, because the mean of its divisors is an integer number (120675516807).
Almost surely, 2241351033613 is an apocalyptic number.
It is an amenable number.
241351033613 is a deficient number, since it is larger than the sum of its proper divisors (1).
241351033613 is an equidigital number, since it uses as much as digits as its factorization.
241351033613 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 19440, while the sum is 32.
Adding to 241351033613 its reverse (316330153142), we get a palindrome (557681186755).
The spelling of 241351033613 in words is "two hundred forty-one billion, three hundred fifty-one million, thirty-three thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.135 sec. • engine limits •