Base | Representation |
---|---|
bin | 100000001101000001010… |
… | …000111101001011111001 |
3 | 21211120010222210112200102 |
4 | 200031001100331023321 |
5 | 242224212244341101 |
6 | 4412350053045145 |
7 | 315612165110012 |
oct | 40150120751371 |
9 | 7746128715612 |
10 | 2213003121401 |
11 | 783590629606 |
12 | 2b8a8a3267b5 |
13 | 1308ba7a8c07 |
14 | 791778b0009 |
15 | 3c872cbd86b |
hex | 2034143d2f9 |
2213003121401 has 4 divisors (see below), whose sum is σ = 2272814016612. Its totient is φ = 2153192226192.
The previous prime is 2213003121397. The next prime is 2213003121419. The reversal of 2213003121401 is 1041213003122.
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 2142578700025 + 70424421376 = 1463755^2 + 265376^2 .
It is a cyclic number.
It is not a de Polignac number, because 2213003121401 - 22 = 2213003121397 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2213003121421) 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, 29905447550 + ... + 29905447623.
It is an arithmetic number, because the mean of its divisors is an integer number (568203504153).
Almost surely, 22213003121401 is an apocalyptic number.
It is an amenable number.
2213003121401 is a deficient number, since it is larger than the sum of its proper divisors (59810895211).
2213003121401 is an equidigital number, since it uses as much as digits as its factorization.
2213003121401 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 59810895210.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 2213003121401 its reverse (1041213003122), we get a palindrome (3254216124523).
The spelling of 2213003121401 in words is "two trillion, two hundred thirteen billion, three million, one hundred twenty-one thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •