Base | Representation |
---|---|
bin | 10000000000011110111… |
… | …010100111111010110001 |
3 | 10220011101000002210010121 |
4 | 100000132322213322301 |
5 | 121010330224441423 |
6 | 2201202535130241 |
7 | 142321530243025 |
oct | 20003672477261 |
9 | 3804330083117 |
10 | 1100030312113 |
11 | 39457a484a27 |
12 | 159239b13981 |
13 | 7c96a15c335 |
14 | 3b355518385 |
15 | 1d93348c45d |
hex | 1001eea7eb1 |
1100030312113 has 2 divisors, whose sum is σ = 1100030312114. Its totient is φ = 1100030312112.
The previous prime is 1100030312111. The next prime is 1100030312159. The reversal of 1100030312113 is 3112130300011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 565401732624 + 534628579489 = 751932^2 + 731183^2 .
It is a cyclic number.
It is not a de Polignac number, because 1100030312113 - 21 = 1100030312111 is a prime.
It is a super-3 number, since 3×11000303121133 (a number of 37 digits) contains 333 as substring.
Together with 1100030312111, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (1100030312111) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 550015156056 + 550015156057.
It is an arithmetic number, because the mean of its divisors is an integer number (550015156057).
Almost surely, 21100030312113 is an apocalyptic number.
It is an amenable number.
1100030312113 is a deficient number, since it is larger than the sum of its proper divisors (1).
1100030312113 is an equidigital number, since it uses as much as digits as its factorization.
1100030312113 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 54, while the sum is 16.
Adding to 1100030312113 its reverse (3112130300011), we get a palindrome (4212160612124).
The spelling of 1100030312113 in words is "one trillion, one hundred billion, thirty million, three hundred twelve thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •