Base | Representation |
---|---|
bin | 110000010010111111011100… |
… | …110011100101001110010101 |
3 | 1000212002022201120001102121001 |
4 | 300102333130303211032111 |
5 | 210320121331401224023 |
6 | 2031432224254023301 |
7 | 62512132220635630 |
oct | 6022773463451625 |
9 | 1025068646042531 |
10 | 212411312133013 |
11 | 6175414a169504 |
12 | 1b9a689a7a7b31 |
13 | 916a3baa9c916 |
14 | 3a64a95cc6c17 |
15 | 198548ba516ad |
hex | c12fdcce5395 |
212411312133013 has 8 divisors (see below), whose sum is σ = 243048614958080. Its totient is φ = 181847216723760.
The previous prime is 212411312133011. The next prime is 212411312133019. The reversal of 212411312133013 is 310331213114212.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 212411312133013 - 21 = 212411312133011 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 (212411312133011) 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, 18301847733 + ... + 18301859338.
It is an arithmetic number, because the mean of its divisors is an integer number (30381076869760).
Almost surely, 2212411312133013 is an apocalyptic number.
It is an amenable number.
212411312133013 is a deficient number, since it is larger than the sum of its proper divisors (30637302825067).
212411312133013 is an equidigital number, since it uses as much as digits as its factorization.
212411312133013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 36603707907.
The product of its (nonzero) digits is 2592, while the sum is 28.
Adding to 212411312133013 its reverse (310331213114212), we get a palindrome (522742525247225).
The spelling of 212411312133013 in words is "two hundred twelve trillion, four hundred eleven billion, three hundred twelve million, one hundred thirty-three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •