Base | Representation |
---|---|
bin | 100000101001001111110… |
… | …101101011111010110101 |
3 | 21221110101022001112102021 |
4 | 200221033311223322311 |
5 | 243223300433331401 |
6 | 4434321414113141 |
7 | 321034241540611 |
oct | 40511765537265 |
9 | 7843338045367 |
10 | 2243312402101 |
11 | 795424405821 |
12 | 30292894b7b1 |
13 | 13370ac6b134 |
14 | 7a811026341 |
15 | 3d548b3b2a1 |
hex | 20a4fd6beb5 |
2243312402101 has 4 divisors (see below), whose sum is σ = 2243319793900. Its totient is φ = 2243305010304.
The previous prime is 2243312402081. The next prime is 2243312402129. The reversal of 2243312402101 is 1012042133422.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 254510160100 + 1988802242001 = 504490^2 + 1410249^2 .
It is a cyclic number.
It is not a de Polignac number, because 2243312402101 - 213 = 2243312393909 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2243312400101) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3220266 + ... + 3854443.
It is an arithmetic number, because the mean of its divisors is an integer number (560829948475).
Almost surely, 22243312402101 is an apocalyptic number.
It is an amenable number.
2243312402101 is a deficient number, since it is larger than the sum of its proper divisors (7391799).
2243312402101 is an equidigital number, since it uses as much as digits as its factorization.
2243312402101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7391798.
The product of its (nonzero) digits is 2304, while the sum is 25.
Adding to 2243312402101 its reverse (1012042133422), we get a palindrome (3255354535523).
The spelling of 2243312402101 in words is "two trillion, two hundred forty-three billion, three hundred twelve million, four hundred two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •