Base | Representation |
---|---|
bin | 1111100001011… |
… | …00001000110101 |
3 | 100002000001121021 |
4 | 13300230020311 |
5 | 231313013323 |
6 | 20530421141 |
7 | 3140501056 |
oct | 760541065 |
9 | 302001537 |
10 | 130204213 |
11 | 67551397 |
12 | 377317b1 |
13 | 20c8a719 |
14 | 1341472d |
15 | b66e05d |
hex | 7c2c235 |
130204213 has 4 divisors (see below), whose sum is σ = 130246828. Its totient is φ = 130161600.
The previous prime is 130204211. The next prime is 130204267. The reversal of 130204213 is 312402031.
It is a happy number.
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 83868964 + 46335249 = 9158^2 + 6807^2 .
It is a cyclic number.
It is not a de Polignac number, because 130204213 - 21 = 130204211 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 (130204211) 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 3 ways as a sum of consecutive naturals, for example, 16338 + ... + 22963.
It is an arithmetic number, because the mean of its divisors is an integer number (32561707).
Almost surely, 2130204213 is an apocalyptic number.
It is an amenable number.
130204213 is a deficient number, since it is larger than the sum of its proper divisors (42615).
130204213 is an equidigital number, since it uses as much as digits as its factorization.
130204213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42614.
The product of its (nonzero) digits is 144, while the sum is 16.
The square root of 130204213 is about 11410.7060693018. The cubic root of 130204213 is about 506.8448199588.
Adding to 130204213 its reverse (312402031), we get a palindrome (442606244).
The spelling of 130204213 in words is "one hundred thirty million, two hundred four thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •