Base | Representation |
---|---|
bin | 1010000000111111010001… |
… | …0100001001011111100001 |
3 | 1102222202011012010112221112 |
4 | 2200033310110021133201 |
5 | 2420410240111231423 |
6 | 35230520002433105 |
7 | 2214412051306055 |
oct | 240176424113741 |
9 | 42882135115845 |
10 | 11012100102113 |
11 | 3566229471800 |
12 | 129a276062795 |
13 | 61b58a2369a6 |
14 | 2a0dba5adc65 |
15 | 1416b3aeea78 |
hex | a03f45097e1 |
11012100102113 has 6 divisors (see below), whose sum is σ = 12104209203282. Its totient is φ = 10011000092720.
The previous prime is 11012100102089. The next prime is 11012100102173. The reversal of 11012100102113 is 31120100121011.
It can be written as a sum of positive squares in only one way, i.e., 5843788916449 + 5168311185664 = 2417393^2 + 2273392^2 .
It is not a de Polignac number, because 11012100102113 - 216 = 11012100036577 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11012100102173) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 45504545756 + ... + 45504545997.
It is an arithmetic number, because the mean of its divisors is an integer number (2017368200547).
Almost surely, 211012100102113 is an apocalyptic number.
It is an amenable number.
11012100102113 is a deficient number, since it is larger than the sum of its proper divisors (1092109101169).
11012100102113 is an equidigital number, since it uses as much as digits as its factorization.
11012100102113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 91009091775 (or 91009091764 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 14.
Adding to 11012100102113 its reverse (31120100121011), we get a palindrome (42132200223124).
The spelling of 11012100102113 in words is "eleven trillion, twelve billion, one hundred million, one hundred two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •