Base | Representation |
---|---|
bin | 11001110001000010100000… |
… | …100001100110010101100001 |
3 | 112212020101121000111102211022 |
4 | 121301002200201212111201 |
5 | 104323123113214100001 |
6 | 1041002555511255225 |
7 | 32604115516345412 |
oct | 3161024041462541 |
9 | 485211530442738 |
10 | 113321110300001 |
11 | 33120238541a9a |
12 | 1086248267a515 |
13 | 4b3019a353826 |
14 | 1ddaab18c1809 |
15 | d17b1ea9e11b |
hex | 6710a0866561 |
113321110300001 has 2 divisors, whose sum is σ = 113321110300002. Its totient is φ = 113321110300000.
The previous prime is 113321110299979. The next prime is 113321110300003. The reversal of 113321110300001 is 100003011123311.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 80614378059601 + 32706732240400 = 8978551^2 + 5718980^2 .
It is a cyclic number.
It is not a de Polignac number, because 113321110300001 - 214 = 113321110283617 is a prime.
Together with 113321110300003, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (113321110300003) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56660555150000 + 56660555150001.
It is an arithmetic number, because the mean of its divisors is an integer number (56660555150001).
Almost surely, 2113321110300001 is an apocalyptic number.
It is an amenable number.
113321110300001 is a deficient number, since it is larger than the sum of its proper divisors (1).
113321110300001 is an equidigital number, since it uses as much as digits as its factorization.
113321110300001 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 17.
Adding to 113321110300001 its reverse (100003011123311), we get a palindrome (213324121423312).
The spelling of 113321110300001 in words is "one hundred thirteen trillion, three hundred twenty-one billion, one hundred ten million, three hundred thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •