Base | Representation |
---|---|
bin | 1100010101110011111… |
… | …0010010100011100111 |
3 | 202021020120022000102101 |
4 | 3011130332102203213 |
5 | 11433200341332221 |
6 | 241221511152531 |
7 | 21213612503041 |
oct | 3053476224347 |
9 | 667216260371 |
10 | 212013230311 |
11 | 81a06a39a13 |
12 | 3510a975747 |
13 | 16cba13698c |
14 | a393784a91 |
15 | 57ace59d91 |
hex | 315cf928e7 |
212013230311 has 4 divisors (see below), whose sum is σ = 223171821400. Its totient is φ = 200854639224.
The previous prime is 212013230309. The next prime is 212013230321. The reversal of 212013230311 is 113032310212.
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 212013230311 - 21 = 212013230309 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (19), and also a Moran number because the ratio is a prime number: 11158591069 = 212013230311 / (2 + 1 + 2 + 0 + 1 + 3 + 2 + 3 + 0 + 3 + 1 + 1).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (212013230321) 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, 5579295516 + ... + 5579295553.
It is an arithmetic number, because the mean of its divisors is an integer number (55792955350).
Almost surely, 2212013230311 is an apocalyptic number.
212013230311 is a deficient number, since it is larger than the sum of its proper divisors (11158591089).
212013230311 is a wasteful number, since it uses less digits than its factorization.
212013230311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11158591088.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 212013230311 its reverse (113032310212), we get a palindrome (325045540523).
The spelling of 212013230311 in words is "two hundred twelve billion, thirteen million, two hundred thirty thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •