Base | Representation |
---|---|
bin | 1110000010010101010… |
… | …0111111000000101111 |
3 | 212001102202210010002011 |
4 | 3200211110333000233 |
5 | 12422330433122133 |
6 | 302440305542051 |
7 | 23264532543226 |
oct | 3404524770057 |
9 | 761382703064 |
10 | 241144426543 |
11 | 932a58188a9 |
12 | 3a89a944927 |
13 | 199805089b7 |
14 | b958673cbd |
15 | 641566a6cd |
hex | 382553f02f |
241144426543 has 2 divisors, whose sum is σ = 241144426544. Its totient is φ = 241144426542.
The previous prime is 241144426531. The next prime is 241144426547. The reversal of 241144426543 is 345624441142.
241144426543 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 is a cyclic number.
It is not a de Polignac number, because 241144426543 - 221 = 241142329391 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 241144426496 and 241144426505.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (241144426547) 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, 120572213271 + 120572213272.
It is an arithmetic number, because the mean of its divisors is an integer number (120572213272).
Almost surely, 2241144426543 is an apocalyptic number.
241144426543 is a deficient number, since it is larger than the sum of its proper divisors (1).
241144426543 is an equidigital number, since it uses as much as digits as its factorization.
241144426543 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 368640, while the sum is 40.
Adding to 241144426543 its reverse (345624441142), we get a palindrome (586768867685).
The spelling of 241144426543 in words is "two hundred forty-one billion, one hundred forty-four million, four hundred twenty-six thousand, five hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •