Base | Representation |
---|---|
bin | 1001001101101010000110… |
… | …0011011110000111011101 |
3 | 1022212102221002000010201001 |
4 | 2103122201203132013131 |
5 | 2311433214242023031 |
6 | 33313434115150301 |
7 | 2063612605266316 |
oct | 223324143360735 |
9 | 38772832003631 |
10 | 10130243314141 |
11 | 325623728a715 |
12 | 1177385ba5391 |
13 | 58637c571502 |
14 | 270440a5360d |
15 | 12879e319861 |
hex | 936a18de1dd |
10130243314141 has 2 divisors, whose sum is σ = 10130243314142. Its totient is φ = 10130243314140.
The previous prime is 10130243314127. The next prime is 10130243314171. The reversal of 10130243314141 is 14141334203101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10115421225625 + 14822088516 = 3180475^2 + 121746^2 .
It is a cyclic number.
It is not a de Polignac number, because 10130243314141 - 239 = 9580487500253 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10130243314171) 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, 5065121657070 + 5065121657071.
It is an arithmetic number, because the mean of its divisors is an integer number (5065121657071).
Almost surely, 210130243314141 is an apocalyptic number.
It is an amenable number.
10130243314141 is a deficient number, since it is larger than the sum of its proper divisors (1).
10130243314141 is an equidigital number, since it uses as much as digits as its factorization.
10130243314141 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 28.
Adding to 10130243314141 its reverse (14141334203101), we get a palindrome (24271577517242).
The spelling of 10130243314141 in words is "ten trillion, one hundred thirty billion, two hundred forty-three million, three hundred fourteen thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •