Base | Representation |
---|---|
bin | 1100011010000001110… |
… | …1100110001011001001 |
3 | 202101011110212210222102 |
4 | 3012200131212023021 |
5 | 11443010222314401 |
6 | 241530120003145 |
7 | 21253641642542 |
oct | 3064035461311 |
9 | 671143783872 |
10 | 213145510601 |
11 | 824380a1951 |
12 | 353860004b5 |
13 | 1713a8aa50a |
14 | a45dcc74c9 |
15 | 582756a56b |
hex | 31a07662c9 |
213145510601 has 2 divisors, whose sum is σ = 213145510602. Its totient is φ = 213145510600.
The previous prime is 213145510583. The next prime is 213145510619. The reversal of 213145510601 is 106015541312.
It is a balanced prime because it is at equal distance from previous prime (213145510583) and next prime (213145510619).
It can be written as a sum of positive squares in only one way, i.e., 125138355001 + 88007155600 = 353749^2 + 296660^2 .
It is a cyclic number.
It is not a de Polignac number, because 213145510601 - 26 = 213145510537 is a prime.
It is a super-2 number, since 2×2131455106012 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (213145510661) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 106572755300 + 106572755301.
It is an arithmetic number, because the mean of its divisors is an integer number (106572755301).
Almost surely, 2213145510601 is an apocalyptic number.
It is an amenable number.
213145510601 is a deficient number, since it is larger than the sum of its proper divisors (1).
213145510601 is an equidigital number, since it uses as much as digits as its factorization.
213145510601 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3600, while the sum is 29.
The spelling of 213145510601 in words is "two hundred thirteen billion, one hundred forty-five million, five hundred ten thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •