Base | Representation |
---|---|
bin | 1001011000001000010000… |
… | …1111010011000100101001 |
3 | 1100111122021101120101212101 |
4 | 2112002010033103010221 |
5 | 2322410131332110233 |
6 | 33532225112013401 |
7 | 2112611611663114 |
oct | 226020417230451 |
9 | 40448241511771 |
10 | 10310140113193 |
11 | 3315562344458 |
12 | 11a6211091261 |
13 | 59a31b9c12bb |
14 | 279028c6757b |
15 | 12d2cc939c7d |
hex | 960843d3129 |
10310140113193 has 2 divisors, whose sum is σ = 10310140113194. Its totient is φ = 10310140113192.
The previous prime is 10310140113151. The next prime is 10310140113197. The reversal of 10310140113193 is 39131104101301.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9981505059904 + 328635053289 = 3159352^2 + 573267^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10310140113193 is a prime.
It is not a weakly prime, because it can be changed into another prime (10310140113197) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5155070056596 + 5155070056597.
It is an arithmetic number, because the mean of its divisors is an integer number (5155070056597).
Almost surely, 210310140113193 is an apocalyptic number.
It is an amenable number.
10310140113193 is a deficient number, since it is larger than the sum of its proper divisors (1).
10310140113193 is an equidigital number, since it uses as much as digits as its factorization.
10310140113193 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 972, while the sum is 28.
Adding to 10310140113193 its reverse (39131104101301), we get a palindrome (49441244214494).
The spelling of 10310140113193 in words is "ten trillion, three hundred ten billion, one hundred forty million, one hundred thirteen thousand, one hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •