Base | Representation |
---|---|
bin | 1001000111011100011100… |
… | …1110010001101101111101 |
3 | 1022111020102000201100022002 |
4 | 2101313013032101231331 |
5 | 2303211112241011031 |
6 | 33152422143232045 |
7 | 2053113462443351 |
oct | 221670716215575 |
9 | 38436360640262 |
10 | 10023501110141 |
11 | 3214a410789a2 |
12 | 115a7562a8625 |
13 | 57929ac9ab5c |
14 | 2691d63c1461 |
15 | 125b03239ccb |
hex | 91dc7391b7d |
10023501110141 has 2 divisors, whose sum is σ = 10023501110142. Its totient is φ = 10023501110140.
The previous prime is 10023501110107. The next prime is 10023501110167. The reversal of 10023501110141 is 14101110532001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6580528084516 + 3442973025625 = 2565254^2 + 1855525^2 .
It is an emirp because it is prime and its reverse (14101110532001) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10023501110141 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10023501110641) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5011750555070 + 5011750555071.
It is an arithmetic number, because the mean of its divisors is an integer number (5011750555071).
Almost surely, 210023501110141 is an apocalyptic number.
It is an amenable number.
10023501110141 is a deficient number, since it is larger than the sum of its proper divisors (1).
10023501110141 is an equidigital number, since it uses as much as digits as its factorization.
10023501110141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 120, while the sum is 20.
Adding to 10023501110141 its reverse (14101110532001), we get a palindrome (24124611642142).
The spelling of 10023501110141 in words is "ten trillion, twenty-three billion, five hundred one million, one hundred ten thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •