Base | Representation |
---|---|
bin | 10010111010110100100… |
… | …110000111001001011101 |
3 | 11121021210220100200201111 |
4 | 102322310212013021131 |
5 | 132300111130404041 |
6 | 2433132353342021 |
7 | 162633636526141 |
oct | 22726446071135 |
9 | 4537726320644 |
10 | 1300110013021 |
11 | 461412232646 |
12 | 18bb78267911 |
13 | 957a4b356c1 |
14 | 46cd6025221 |
15 | 23c43906981 |
hex | 12eb498725d |
1300110013021 has 2 divisors, whose sum is σ = 1300110013022. Its totient is φ = 1300110013020.
The previous prime is 1300110013019. The next prime is 1300110013031. The reversal of 1300110013021 is 1203100110031.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 951229596100 + 348880416921 = 975310^2 + 590661^2 .
It is a cyclic number.
It is not a de Polignac number, because 1300110013021 - 21 = 1300110013019 is a prime.
Together with 1300110013019, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 1300110012992 and 1300110013010.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1300110013001) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 650055006510 + 650055006511.
It is an arithmetic number, because the mean of its divisors is an integer number (650055006511).
Almost surely, 21300110013021 is an apocalyptic number.
It is an amenable number.
1300110013021 is a deficient number, since it is larger than the sum of its proper divisors (1).
1300110013021 is an equidigital number, since it uses as much as digits as its factorization.
1300110013021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 18, while the sum is 13.
Adding to 1300110013021 its reverse (1203100110031), we get a palindrome (2503210123052).
The spelling of 1300110013021 in words is "one trillion, three hundred billion, one hundred ten million, thirteen thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •