Base | Representation |
---|---|
bin | 10011010010010011001010… |
… | …00110000001111101010001 |
3 | 12120011101010222101111002001 |
4 | 21221021211012001331101 |
5 | 21024322044002113101 |
6 | 230110551154354001 |
7 | 11635015240634116 |
oct | 1151114506017521 |
9 | 176141128344061 |
10 | 42410203160401 |
11 | 1257108006371a |
12 | 490b46b28b901 |
13 | 1a8835a27a28b |
14 | a6894425690d |
15 | 4d82c0231901 |
hex | 269265181f51 |
42410203160401 has 2 divisors, whose sum is σ = 42410203160402. Its totient is φ = 42410203160400.
The previous prime is 42410203160383. The next prime is 42410203160407. The reversal of 42410203160401 is 10406130201424.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 22793453514001 + 19616749646400 = 4774249^2 + 4429080^2 .
It is a cyclic number.
It is not a de Polignac number, because 42410203160401 - 211 = 42410203158353 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 42410203160401.
It is not a weakly prime, because it can be changed into another prime (42410203160407) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 21205101580200 + 21205101580201.
It is an arithmetic number, because the mean of its divisors is an integer number (21205101580201).
Almost surely, 242410203160401 is an apocalyptic number.
It is an amenable number.
42410203160401 is a deficient number, since it is larger than the sum of its proper divisors (1).
42410203160401 is an equidigital number, since it uses as much as digits as its factorization.
42410203160401 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4608, while the sum is 28.
Adding to 42410203160401 its reverse (10406130201424), we get a palindrome (52816333361825).
The spelling of 42410203160401 in words is "forty-two trillion, four hundred ten billion, two hundred three million, one hundred sixty thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •