Base | Representation |
---|---|
bin | 1100010101110011111… |
… | …0101001000001010011 |
3 | 202021020120110200122020 |
4 | 3011130332221001103 |
5 | 11433200402303243 |
6 | 241221513142523 |
7 | 21213613335225 |
oct | 3053476510123 |
9 | 667216420566 |
10 | 212013322323 |
11 | 81a06aa2060 |
12 | 3510a9baa43 |
13 | 16cba16981a |
14 | a3937aa415 |
15 | 57ace77283 |
hex | 315cfa9053 |
212013322323 has 16 divisors (see below), whose sum is σ = 308790425856. Its totient is φ = 128323167840.
The previous prime is 212013322277. The next prime is 212013322373. The reversal of 212013322323 is 323223310212.
212013322323 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 212013322323 - 212 = 212013318227 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 212013322293 and 212013322302.
It is not an unprimeable number, because it can be changed into a prime (212013322373) 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 15 ways as a sum of consecutive naturals, for example, 4218511 + ... + 4268472.
It is an arithmetic number, because the mean of its divisors is an integer number (19299401616).
Almost surely, 2212013322323 is an apocalyptic number.
212013322323 is a deficient number, since it is larger than the sum of its proper divisors (96777103533).
212013322323 is a wasteful number, since it uses less digits than its factorization.
212013322323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8487754.
The product of its (nonzero) digits is 2592, while the sum is 24.
Adding to 212013322323 its reverse (323223310212), we get a palindrome (535236632535).
The spelling of 212013322323 in words is "two hundred twelve billion, thirteen million, three hundred twenty-two thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •