Base | Representation |
---|---|
bin | 1110000001111010101… |
… | …0001011010010001111 |
3 | 212001010222020202102021 |
4 | 3200132222023102033 |
5 | 12422113312310302 |
6 | 302421231511011 |
7 | 23262003540244 |
oct | 3403652132217 |
9 | 761128222367 |
10 | 241032541327 |
11 | 93248649886 |
12 | 3a869388467 |
13 | 19963293526 |
14 | b94786b5cb |
15 | 640a919437 |
hex | 381ea8b48f |
241032541327 has 2 divisors, whose sum is σ = 241032541328. Its totient is φ = 241032541326.
The previous prime is 241032541297. The next prime is 241032541363. The reversal of 241032541327 is 723145230142.
241032541327 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 241032541327 - 227 = 240898323599 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 241032541292 and 241032541301.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (241032542327) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 120516270663 + 120516270664.
It is an arithmetic number, because the mean of its divisors is an integer number (120516270664).
Almost surely, 2241032541327 is an apocalyptic number.
241032541327 is a deficient number, since it is larger than the sum of its proper divisors (1).
241032541327 is an equidigital number, since it uses as much as digits as its factorization.
241032541327 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 40320, while the sum is 34.
Adding to 241032541327 its reverse (723145230142), we get a palindrome (964177771469).
The spelling of 241032541327 in words is "two hundred forty-one billion, thirty-two million, five hundred forty-one thousand, three hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •