Base | Representation |
---|---|
bin | 1100011010000001100… |
… | …0010011010000100001 |
3 | 202101011101021021201121 |
4 | 3012200120103100201 |
5 | 11443004343404101 |
6 | 241530030132241 |
7 | 21253624101400 |
oct | 3064030232041 |
9 | 671141237647 |
10 | 213144122401 |
11 | 82437333981 |
12 | 35385651081 |
13 | 1713a5126b2 |
14 | a45da45637 |
15 | 58273940a1 |
hex | 31a0613421 |
213144122401 has 24 divisors (see below), whose sum is σ = 266831856936. Its totient is φ = 169129336320.
The previous prime is 213144122393. The next prime is 213144122413. The reversal of 213144122401 is 104221441312.
It can be written as a sum of positive squares in 4 ways, for example, as 314140176 + 212829982225 = 17724^2 + 461335^2 .
It is not a de Polignac number, because 213144122401 - 23 = 213144122393 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (213144122461) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2046526 + ... + 2148151.
It is an arithmetic number, because the mean of its divisors is an integer number (11117994039).
Almost surely, 2213144122401 is an apocalyptic number.
It is an amenable number.
213144122401 is a deficient number, since it is larger than the sum of its proper divisors (53687734535).
213144122401 is a wasteful number, since it uses less digits than its factorization.
213144122401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4194769 (or 4194762 counting only the distinct ones).
The product of its (nonzero) digits is 1536, while the sum is 25.
Adding to 213144122401 its reverse (104221441312), we get a palindrome (317365563713).
The spelling of 213144122401 in words is "two hundred thirteen billion, one hundred forty-four million, one hundred twenty-two thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •