Base | Representation |
---|---|
bin | 11101010010111101110… |
… | …111010111011001010101 |
3 | 21010110111110121200011121 |
4 | 131102331313113121111 |
5 | 230441043401231401 |
6 | 4140510512003541 |
7 | 265310501342221 |
oct | 35227567273125 |
9 | 7113443550147 |
10 | 2013230102101 |
11 | 7068959a9369 |
12 | 2862168305b1 |
13 | 117b014cc95a |
14 | 6d6259d5781 |
15 | 3757e732ca1 |
hex | 1d4bddd7655 |
2013230102101 has 2 divisors, whose sum is σ = 2013230102102. Its totient is φ = 2013230102100.
The previous prime is 2013230102099. The next prime is 2013230102137. The reversal of 2013230102101 is 1012010323102.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1858505092900 + 154725009201 = 1363270^2 + 393351^2 .
It is a cyclic number.
It is not a de Polignac number, because 2013230102101 - 21 = 2013230102099 is a prime.
It is a super-2 number, since 2×20132301021012 (a number of 25 digits) contains 22 as substring.
Together with 2013230102099, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2013230102141) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1006615051050 + 1006615051051.
It is an arithmetic number, because the mean of its divisors is an integer number (1006615051051).
Almost surely, 22013230102101 is an apocalyptic number.
It is an amenable number.
2013230102101 is a deficient number, since it is larger than the sum of its proper divisors (1).
2013230102101 is an equidigital number, since it uses as much as digits as its factorization.
2013230102101 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 2013230102101 its reverse (1012010323102), we get a palindrome (3025240425203).
The spelling of 2013230102101 in words is "two trillion, thirteen billion, two hundred thirty million, one hundred two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •