Base | Representation |
---|---|
bin | 10110100010101011… |
… | …00011100000110111 |
3 | 1011020102002110220100 |
4 | 23101111203200313 |
5 | 144241104220343 |
6 | 5320512205143 |
7 | 605620333353 |
oct | 132125434067 |
9 | 34212073810 |
10 | 12102023223 |
11 | 5150305194 |
12 | 2418b397b3 |
13 | 11ab3361b4 |
14 | 82b3b8463 |
15 | 4ac6c49d3 |
hex | 2d1563837 |
12102023223 has 12 divisors (see below), whose sum is σ = 18508976928. Its totient is φ = 7593426240.
The previous prime is 12102023149. The next prime is 12102023237. The reversal of 12102023223 is 32232020121.
12102023223 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 12102023223 - 217 = 12101892151 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12102023196 and 12102023205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12102023273) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 39548943 + ... + 39549248.
It is an arithmetic number, because the mean of its divisors is an integer number (1542414744).
Almost surely, 212102023223 is an apocalyptic number.
12102023223 is a deficient number, since it is larger than the sum of its proper divisors (6406953705).
12102023223 is a wasteful number, since it uses less digits than its factorization.
12102023223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 79098214 (or 79098211 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 18.
Adding to 12102023223 its reverse (32232020121), we get a palindrome (44334043344).
The spelling of 12102023223 in words is "twelve billion, one hundred two million, twenty-three thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •