Base | Representation |
---|---|
bin | 1100010111011010001… |
… | …1001000110010010111 |
3 | 202022100110201000211221 |
4 | 3011312203020302113 |
5 | 11440040213220043 |
6 | 241332240111211 |
7 | 21230342632333 |
oct | 3056643106227 |
9 | 668313630757 |
10 | 212442320023 |
11 | 8210717340a |
12 | 3520a605507 |
13 | 17057cc1b0b |
14 | a3d475c7c3 |
15 | 57d59678ed |
hex | 31768c8c97 |
212442320023 has 2 divisors, whose sum is σ = 212442320024. Its totient is φ = 212442320022.
The previous prime is 212442320009. The next prime is 212442320059. The reversal of 212442320023 is 320023244212.
212442320023 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-212442320023 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 212442320023.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (212442320093) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 106221160011 + 106221160012.
It is an arithmetic number, because the mean of its divisors is an integer number (106221160012).
Almost surely, 2212442320023 is an apocalyptic number.
212442320023 is a deficient number, since it is larger than the sum of its proper divisors (1).
212442320023 is an equidigital number, since it uses as much as digits as its factorization.
212442320023 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4608, while the sum is 25.
Adding to 212442320023 its reverse (320023244212), we get a palindrome (532465564235).
The spelling of 212442320023 in words is "two hundred twelve billion, four hundred forty-two million, three hundred twenty thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •