Base | Representation |
---|---|
bin | 1100011001111110001… |
… | …1101010000001011101 |
3 | 202101010102022011011010 |
4 | 3012133203222001131 |
5 | 11442442330301023 |
6 | 241524414245433 |
7 | 21253365563130 |
oct | 3063743520135 |
9 | 671112264133 |
10 | 213130322013 |
11 | 8242a5684a4 |
12 | 35380ab6879 |
13 | 171376c009b |
14 | a45bc92217 |
15 | 582606a093 |
hex | 319f8ea05d |
213130322013 has 32 divisors (see below), whose sum is σ = 327343813632. Its totient is φ = 120824121600.
The previous prime is 213130322003. The next prime is 213130322023. The reversal of 213130322013 is 310223031312.
It is an interprime number because it is at equal distance from previous prime (213130322003) and next prime (213130322023).
It is not a de Polignac number, because 213130322013 - 26 = 213130321949 is a prime.
It is a super-2 number, since 2×2131303220132 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (213130322003) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 11745958 + ... + 11764088.
It is an arithmetic number, because the mean of its divisors is an integer number (10229494176).
Almost surely, 2213130322013 is an apocalyptic number.
It is an amenable number.
213130322013 is a deficient number, since it is larger than the sum of its proper divisors (114213491619).
213130322013 is a wasteful number, since it uses less digits than its factorization.
213130322013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 22545.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 213130322013 its reverse (310223031312), we get a palindrome (523353353325).
The spelling of 213130322013 in words is "two hundred thirteen billion, one hundred thirty million, three hundred twenty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •