Base | Representation |
---|---|
bin | 1100010110101000000… |
… | …1010010101111101011 |
3 | 202021210211011211102220 |
4 | 3011222001102233223 |
5 | 11434122410340243 |
6 | 241255330525123 |
7 | 21222211160205 |
oct | 3055201225753 |
9 | 667724154386 |
10 | 212232121323 |
11 | 82009554a82 |
12 | 351701367a3 |
13 | 170235a66a1 |
14 | a3b4883775 |
15 | 57c2296783 |
hex | 316a052beb |
212232121323 has 32 divisors (see below), whose sum is σ = 298730521152. Its totient is φ = 133847193600.
The previous prime is 212232121271. The next prime is 212232121337. The reversal of 212232121323 is 323121232212.
212232121323 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 212232121323 - 29 = 212232120811 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 212232121293 and 212232121302.
It is not an unprimeable number, because it can be changed into a prime (212232121363) 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 in 31 ways as a sum of consecutive naturals, for example, 1253863 + ... + 1413023.
It is an arithmetic number, because the mean of its divisors is an integer number (9335328786).
Almost surely, 2212232121323 is an apocalyptic number.
212232121323 is a deficient number, since it is larger than the sum of its proper divisors (86498399829).
212232121323 is a wasteful number, since it uses less digits than its factorization.
212232121323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 159535.
The product of its digits is 1728, while the sum is 24.
Adding to 212232121323 its reverse (323121232212), we get a palindrome (535353353535).
The spelling of 212232121323 in words is "two hundred twelve billion, two hundred thirty-two million, one hundred twenty-one thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •