Base | Representation |
---|---|
bin | 10011010010010011001011… |
… | …01111100100100110111001 |
3 | 12120011101011201212202010011 |
4 | 21221021211233210212321 |
5 | 21024322104244101413 |
6 | 230110552224021521 |
7 | 11635015432330651 |
oct | 1151114557444671 |
9 | 176141151782104 |
10 | 42410214050233 |
11 | 12571086221387 |
12 | 490b472a618a1 |
13 | 1a8835c5c0b73 |
14 | a6894588d361 |
15 | 4d82c118333d |
hex | 269265be49b9 |
42410214050233 has 2 divisors, whose sum is σ = 42410214050234. Its totient is φ = 42410214050232.
The previous prime is 42410214050189. The next prime is 42410214050251. The reversal of 42410214050233 is 33205041201424.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 21617589878784 + 20792624171449 = 4649472^2 + 4559893^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-42410214050233 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 42410214050195 and 42410214050204.
It is not a weakly prime, because it can be changed into another prime (42410214020233) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 21205107025116 + 21205107025117.
It is an arithmetic number, because the mean of its divisors is an integer number (21205107025117).
Almost surely, 242410214050233 is an apocalyptic number.
It is an amenable number.
42410214050233 is a deficient number, since it is larger than the sum of its proper divisors (1).
42410214050233 is an equidigital number, since it uses as much as digits as its factorization.
42410214050233 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 23040, while the sum is 31.
Adding to 42410214050233 its reverse (33205041201424), we get a palindrome (75615255251657).
The spelling of 42410214050233 in words is "forty-two trillion, four hundred ten billion, two hundred fourteen million, fifty thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •