Base | Representation |
---|---|
bin | 11101011011001001110… |
… | …01100000001010001101 |
3 | 10120122121000212222011100 |
4 | 32231210321200022031 |
5 | 113031022042010333 |
6 | 2052241315213313 |
7 | 133020526100244 |
oct | 16554471401215 |
9 | 3518530788140 |
10 | 1011010110093 |
11 | 35a848939635 |
12 | 143b352a7239 |
13 | 74451322b99 |
14 | 36d0c7c995b |
15 | 1b473151213 |
hex | eb64e6028d |
1011010110093 has 12 divisors (see below), whose sum is σ = 1495966179708. Its totient is φ = 657567551040.
The previous prime is 1011010110059. The next prime is 1011010110101. The reversal of 1011010110093 is 3900110101101.
It can be written as a sum of positive squares in 2 ways, for example, as 68009859369 + 943000250724 = 260787^2 + 971082^2 .
It is not a de Polignac number, because 1011010110093 - 212 = 1011010105997 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1011010110013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1369932030 + ... + 1369932767.
It is an arithmetic number, because the mean of its divisors is an integer number (124663848309).
Almost surely, 21011010110093 is an apocalyptic number.
It is an amenable number.
1011010110093 is a deficient number, since it is larger than the sum of its proper divisors (484956069615).
1011010110093 is a wasteful number, since it uses less digits than its factorization.
1011010110093 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2739864844 (or 2739864841 counting only the distinct ones).
The product of its (nonzero) digits is 27, while the sum is 18.
Adding to 1011010110093 its reverse (3900110101101), we get a palindrome (4911120211194).
The spelling of 1011010110093 in words is "one trillion, eleven billion, ten million, one hundred ten thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •