Base | Representation |
---|---|
bin | 11101010010111110100… |
… | …100111000000000000101 |
3 | 21010110112022001210002122 |
4 | 131102332210320000011 |
5 | 230441104430012013 |
6 | 4140512015415325 |
7 | 265311004630523 |
oct | 35227644700005 |
9 | 7113468053078 |
10 | 2013242032133 |
11 | 7068a17075a2 |
12 | 28621a824545 |
13 | 117b03b18b47 |
14 | 6d62741d313 |
15 | 375807dca08 |
hex | 1d4be938005 |
2013242032133 has 2 divisors, whose sum is σ = 2013242032134. Its totient is φ = 2013242032132.
The previous prime is 2013242032057. The next prime is 2013242032223. The reversal of 2013242032133 is 3312302423102.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1814131528609 + 199110503524 = 1346897^2 + 446218^2 .
It is a cyclic number.
It is not a de Polignac number, because 2013242032133 - 210 = 2013242031109 is a prime.
It is a super-2 number, since 2×20132420321332 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2013242032033) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1006621016066 + 1006621016067.
It is an arithmetic number, because the mean of its divisors is an integer number (1006621016067).
Almost surely, 22013242032133 is an apocalyptic number.
It is an amenable number.
2013242032133 is a deficient number, since it is larger than the sum of its proper divisors (1).
2013242032133 is an equidigital number, since it uses as much as digits as its factorization.
2013242032133 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 5184, while the sum is 26.
Adding to 2013242032133 its reverse (3312302423102), we get a palindrome (5325544455235).
The spelling of 2013242032133 in words is "two trillion, thirteen billion, two hundred forty-two million, thirty-two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •