Base | Representation |
---|---|
bin | 1001001110010111011011… |
… | …0100101110110000101001 |
3 | 1022220121100002020220021002 |
4 | 2103211312310232300221 |
5 | 2312133124244222421 |
6 | 33323205345524345 |
7 | 2064523256526155 |
oct | 223456664566051 |
9 | 38817302226232 |
10 | 10142411320361 |
11 | 3260410861901 |
12 | 11798010436b5 |
13 | 58756b46a9a8 |
14 | 270c76ac6065 |
15 | 128c626c4b0b |
hex | 93976d2ec29 |
10142411320361 has 2 divisors, whose sum is σ = 10142411320362. Its totient is φ = 10142411320360.
The previous prime is 10142411320247. The next prime is 10142411320367. The reversal of 10142411320361 is 16302311424101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7141828656400 + 3000582663961 = 2672420^2 + 1732219^2 .
It is a cyclic number.
It is not a de Polignac number, because 10142411320361 - 218 = 10142411058217 is a prime.
It is not a weakly prime, because it can be changed into another prime (10142411320367) 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, 5071205660180 + 5071205660181.
It is an arithmetic number, because the mean of its divisors is an integer number (5071205660181).
Almost surely, 210142411320361 is an apocalyptic number.
It is an amenable number.
10142411320361 is a deficient number, since it is larger than the sum of its proper divisors (1).
10142411320361 is an equidigital number, since it uses as much as digits as its factorization.
10142411320361 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3456, while the sum is 29.
Adding to 10142411320361 its reverse (16302311424101), we get a palindrome (26444722744462).
The spelling of 10142411320361 in words is "ten trillion, one hundred forty-two billion, four hundred eleven million, three hundred twenty thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •