Base | Representation |
---|---|
bin | 1100010010000101001… |
… | …1011001110010101101 |
3 | 202011122210112221201122 |
4 | 3010201103121302231 |
5 | 11424123101211023 |
6 | 240534310150325 |
7 | 21150035346104 |
oct | 3044123316255 |
9 | 664583487648 |
10 | 211012132013 |
11 | 81542935a51 |
12 | 34a8b6523a5 |
13 | 16b8a903917 |
14 | a2da82d03b |
15 | 575010d2c8 |
hex | 31214d9cad |
211012132013 has 8 divisors (see below), whose sum is σ = 211491163296. Its totient is φ = 210533302000.
The previous prime is 211012132007. The next prime is 211012132021. The reversal of 211012132013 is 310231210112.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 211012132013 - 218 = 211011869869 is a prime.
It is a super-2 number, since 2×2110121320132 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 211012131982 and 211012132000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (211012132003) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2158238 + ... + 2253888.
It is an arithmetic number, because the mean of its divisors is an integer number (26436395412).
Almost surely, 2211012132013 is an apocalyptic number.
It is an amenable number.
211012132013 is a deficient number, since it is larger than the sum of its proper divisors (479031283).
211012132013 is an equidigital number, since it uses as much as digits as its factorization.
211012132013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 100635.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 211012132013 its reverse (310231210112), we get a palindrome (521243342125).
The spelling of 211012132013 in words is "two hundred eleven billion, twelve million, one hundred thirty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •