Base | Representation |
---|---|
bin | 1110000011010101010… |
… | …1111111010100101111 |
3 | 212002010111101102122112 |
4 | 3200311111333110233 |
5 | 12423403230003143 |
6 | 302523105034235 |
7 | 23304304465001 |
oct | 3406525772457 |
9 | 762114342575 |
10 | 241413125423 |
11 | 93423463298 |
12 | 3a95492597b |
13 | 199c4097512 |
14 | b98221a371 |
15 | 642e044e18 |
hex | 383557f52f |
241413125423 has 2 divisors, whose sum is σ = 241413125424. Its totient is φ = 241413125422.
The previous prime is 241413125381. The next prime is 241413125431. The reversal of 241413125423 is 324521314142.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 241413125423 - 222 = 241408931119 is a prime.
It is a super-2 number, since 2×2414131254232 (a number of 24 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 241413125423.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (241413125323) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 120706562711 + 120706562712.
It is an arithmetic number, because the mean of its divisors is an integer number (120706562712).
Almost surely, 2241413125423 is an apocalyptic number.
241413125423 is a deficient number, since it is larger than the sum of its proper divisors (1).
241413125423 is an equidigital number, since it uses as much as digits as its factorization.
241413125423 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 23040, while the sum is 32.
Adding to 241413125423 its reverse (324521314142), we get a palindrome (565934439565).
The spelling of 241413125423 in words is "two hundred forty-one billion, four hundred thirteen million, one hundred twenty-five thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •