Base | Representation |
---|---|
bin | 10000000000100011001… |
… | …100011110010101011001 |
3 | 10220011120000012000000211 |
4 | 100000203030132111121 |
5 | 121011002114202223 |
6 | 2201214021531121 |
7 | 142323361365046 |
oct | 20004314362531 |
9 | 3804500160024 |
10 | 1100102100313 |
11 | 394606a57517 |
12 | 159259b73aa1 |
13 | 7c97bca5a68 |
14 | 3b360c841cd |
15 | 1d93991cd0d |
hex | 1002331e559 |
1100102100313 has 2 divisors, whose sum is σ = 1100102100314. Its totient is φ = 1100102100312.
The previous prime is 1100102100283. The next prime is 1100102100319. The reversal of 1100102100313 is 3130012010011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 971086080969 + 129016019344 = 985437^2 + 359188^2 .
It is a cyclic number.
It is not a de Polignac number, because 1100102100313 - 25 = 1100102100281 is a prime.
It is a super-2 number, since 2×11001021003132 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1100102100293 and 1100102100302.
It is not a weakly prime, because it can be changed into another prime (1100102100319) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 550051050156 + 550051050157.
It is an arithmetic number, because the mean of its divisors is an integer number (550051050157).
Almost surely, 21100102100313 is an apocalyptic number.
It is an amenable number.
1100102100313 is a deficient number, since it is larger than the sum of its proper divisors (1).
1100102100313 is an equidigital number, since it uses as much as digits as its factorization.
1100102100313 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 18, while the sum is 13.
Adding to 1100102100313 its reverse (3130012010011), we get a palindrome (4230114110324).
The spelling of 1100102100313 in words is "one trillion, one hundred billion, one hundred two million, one hundred thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •