Base | Representation |
---|---|
bin | 1001000110101110010001… |
… | …0100011001011101110001 |
3 | 1022110001102002000210020212 |
4 | 2101223210110121131301 |
5 | 2303010220203231423 |
6 | 33143012101513505 |
7 | 2052164332646564 |
oct | 221534424313561 |
9 | 38401362023225 |
10 | 10011104352113 |
11 | 320a75a466127 |
12 | 1158276712895 |
13 | 57807388b587 |
14 | 26877bc044db |
15 | 125629c46578 |
hex | 91ae4519771 |
10011104352113 has 2 divisors, whose sum is σ = 10011104352114. Its totient is φ = 10011104352112.
The previous prime is 10011104352097. The next prime is 10011104352131. The reversal of 10011104352113 is 31125340111001.
Together with next prime (10011104352131) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9750424669489 + 260679682624 = 3122567^2 + 510568^2 .
It is a cyclic number.
It is not a de Polignac number, because 10011104352113 - 24 = 10011104352097 is a prime.
It is not a weakly prime, because it can be changed into another prime (10011104322113) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5005552176056 + 5005552176057.
It is an arithmetic number, because the mean of its divisors is an integer number (5005552176057).
Almost surely, 210011104352113 is an apocalyptic number.
It is an amenable number.
10011104352113 is a deficient number, since it is larger than the sum of its proper divisors (1).
10011104352113 is an equidigital number, since it uses as much as digits as its factorization.
10011104352113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 360, while the sum is 23.
Adding to 10011104352113 its reverse (31125340111001), we get a palindrome (41136444463114).
The spelling of 10011104352113 in words is "ten trillion, eleven billion, one hundred four million, three hundred fifty-two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •