Base | Representation |
---|---|
bin | 1100011001011111011… |
… | …0110101000011110111 |
3 | 202100210102012112100022 |
4 | 3012113312311003313 |
5 | 11442211242131411 |
6 | 241503521235355 |
7 | 21250236506531 |
oct | 3062766650367 |
9 | 670712175308 |
10 | 213001130231 |
11 | 8237364882a |
12 | 35345792b5b |
13 | 171169c8446 |
14 | a448a62851 |
15 | 5819a4aedb |
hex | 3197db50f7 |
213001130231 has 4 divisors (see below), whose sum is σ = 219872134464. Its totient is φ = 206130126000.
The previous prime is 213001130213. The next prime is 213001130297. The reversal of 213001130231 is 132031100312.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 213001130231 - 222 = 212996935927 is a prime.
It is a super-2 number, since 2×2130011302312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (213001130431) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3435502070 + ... + 3435502131.
It is an arithmetic number, because the mean of its divisors is an integer number (54968033616).
Almost surely, 2213001130231 is an apocalyptic number.
213001130231 is a deficient number, since it is larger than the sum of its proper divisors (6871004233).
213001130231 is an equidigital number, since it uses as much as digits as its factorization.
213001130231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6871004232.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 213001130231 its reverse (132031100312), we get a palindrome (345032230543).
The spelling of 213001130231 in words is "two hundred thirteen billion, one million, one hundred thirty thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •