Base | Representation |
---|---|
bin | 100111000111100101… |
… | …010001000111101101 |
3 | 11000102021022122111122 |
4 | 213013211101013231 |
5 | 1142010301003401 |
6 | 31143533030325 |
7 | 3014606544215 |
oct | 470745210755 |
9 | 130367278448 |
10 | 42003141101 |
11 | 168a4750659 |
12 | 81829253a5 |
13 | 3c6508955c |
14 | 2066643245 |
15 | 115c7ba21b |
hex | 9c79511ed |
42003141101 has 2 divisors, whose sum is σ = 42003141102. Its totient is φ = 42003141100.
The previous prime is 42003141077. The next prime is 42003141163. The reversal of 42003141101 is 10114130024.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 29347116100 + 12656025001 = 171310^2 + 112499^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-42003141101 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 42003141101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (42003141701) 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, 21001570550 + 21001570551.
It is an arithmetic number, because the mean of its divisors is an integer number (21001570551).
Almost surely, 242003141101 is an apocalyptic number.
It is an amenable number.
42003141101 is a deficient number, since it is larger than the sum of its proper divisors (1).
42003141101 is an equidigital number, since it uses as much as digits as its factorization.
42003141101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 96, while the sum is 17.
Adding to 42003141101 its reverse (10114130024), we get a palindrome (52117271125).
The spelling of 42003141101 in words is "forty-two billion, three million, one hundred forty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •