Base | Representation |
---|---|
bin | 1100010110001101101… |
… | …0001101000010000101 |
3 | 202021112002111000002122 |
4 | 3011203122031002011 |
5 | 11433411012223023 |
6 | 241240325415325 |
7 | 21216363354425 |
oct | 3054332150205 |
9 | 667462430078 |
10 | 212121211013 |
11 | 81a61991468 |
12 | 3513ab6a545 |
13 | 17006612b9a |
14 | a3a3c52485 |
15 | 57b76892c8 |
hex | 316368d085 |
212121211013 has 4 divisors (see below), whose sum is σ = 212390743200. Its totient is φ = 211851678828.
The previous prime is 212121211009. The next prime is 212121211019. The reversal of 212121211013 is 310112121212.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 212121211013 - 22 = 212121211009 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 212121210982 and 212121211000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (212121211019) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 134764913 + ... + 134766486.
It is an arithmetic number, because the mean of its divisors is an integer number (53097685800).
Almost surely, 2212121211013 is an apocalyptic number.
It is an amenable number.
212121211013 is a deficient number, since it is larger than the sum of its proper divisors (269532187).
212121211013 is an equidigital number, since it uses as much as digits as its factorization.
212121211013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 269532186.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 212121211013 its reverse (310112121212), we get a palindrome (522233332225).
The spelling of 212121211013 in words is "two hundred twelve billion, one hundred twenty-one million, two hundred eleven thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.156 sec. • engine limits •