Base | Representation |
---|---|
bin | 10010111001000010010001… |
… | …01011111011111101111001 |
3 | 12110002101112101100201020101 |
4 | 21130201020223323331321 |
5 | 20421111302122224111 |
6 | 224204110324155401 |
7 | 11515215014464324 |
oct | 1134411053737571 |
9 | 173071471321211 |
10 | 41542143164281 |
11 | 12266a188a6551 |
12 | 47ab18b838b61 |
13 | 1a2453aa85366 |
14 | a38916bd77bb |
15 | 4c0916cdebc1 |
hex | 25c848afbf79 |
41542143164281 has 2 divisors, whose sum is σ = 41542143164282. Its totient is φ = 41542143164280.
The previous prime is 41542143164243. The next prime is 41542143164303. The reversal of 41542143164281 is 18246134124514.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 38013587546256 + 3528555618025 = 6165516^2 + 1878445^2 .
It is a cyclic number.
It is not a de Polignac number, because 41542143164281 - 29 = 41542143163769 is a prime.
It is a super-2 number, since 2×415421431642812 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (41542143134281) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 20771071582140 + 20771071582141.
It is an arithmetic number, because the mean of its divisors is an integer number (20771071582141).
Almost surely, 241542143164281 is an apocalyptic number.
It is an amenable number.
41542143164281 is a deficient number, since it is larger than the sum of its proper divisors (1).
41542143164281 is an equidigital number, since it uses as much as digits as its factorization.
41542143164281 is an evil number, because the sum of its binary digits is even.
The product of its digits is 737280, while the sum is 46.
Adding to 41542143164281 its reverse (18246134124514), we get a palindrome (59788277288795).
The spelling of 41542143164281 in words is "forty-one trillion, five hundred forty-two billion, one hundred forty-three million, one hundred sixty-four thousand, two hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •