Base | Representation |
---|---|
bin | 11001011010000… |
… | …01111001100001 |
3 | 112212001011120011 |
4 | 30231001321201 |
5 | 414030141344 |
6 | 33052044521 |
7 | 5165403511 |
oct | 1455017141 |
9 | 485034504 |
10 | 213130849 |
11 | aa3413a8 |
12 | 5b463741 |
13 | 35203c39 |
14 | 2043d841 |
15 | 13a9ed34 |
hex | cb41e61 |
213130849 has 2 divisors, whose sum is σ = 213130850. Its totient is φ = 213130848.
The previous prime is 213130817. The next prime is 213130867. The reversal of 213130849 is 948031312.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 141610000 + 71520849 = 11900^2 + 8457^2 .
It is a cyclic number.
It is not a de Polignac number, because 213130849 - 25 = 213130817 is a prime.
It is a super-3 number, since 3×2131308493 (a number of 26 digits) contains 333 as substring.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 213130849.
It is not a weakly prime, because it can be changed into another prime (211130849) 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 as a sum of consecutive naturals, namely, 106565424 + 106565425.
It is an arithmetic number, because the mean of its divisors is an integer number (106565425).
Almost surely, 2213130849 is an apocalyptic number.
It is an amenable number.
213130849 is a deficient number, since it is larger than the sum of its proper divisors (1).
213130849 is an equidigital number, since it uses as much as digits as its factorization.
213130849 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5184, while the sum is 31.
The square root of 213130849 is about 14599.0016439481. The cubic root of 213130849 is about 597.3315283965.
The spelling of 213130849 in words is "two hundred thirteen million, one hundred thirty thousand, eight hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •