Base | Representation |
---|---|
bin | 110011110010011000… |
… | …0111010011101100111 |
3 | 101122001120101121220121 |
4 | 1213210300322131213 |
5 | 3310230311210043 |
6 | 123031251342411 |
7 | 11014641121315 |
oct | 1474460723547 |
9 | 348046347817 |
10 | 111212210023 |
11 | 4318a436482 |
12 | 196788b1a07 |
13 | a6446a7b45 |
14 | 55501b10b5 |
15 | 2d5d745ded |
hex | 19e4c3a767 |
111212210023 has 4 divisors (see below), whose sum is σ = 111213532960. Its totient is φ = 111210887088.
The previous prime is 111212209993. The next prime is 111212210033. The reversal of 111212210023 is 320012212111.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 320012212111 = 3943 ⋅81159577.
It is a cyclic number.
It is not a de Polignac number, because 111212210023 - 213 = 111212201831 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 111212209979 and 111212210006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111212210033) 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, 526143 + ... + 706576.
It is an arithmetic number, because the mean of its divisors is an integer number (27803383240).
Almost surely, 2111212210023 is an apocalyptic number.
111212210023 is a deficient number, since it is larger than the sum of its proper divisors (1322937).
111212210023 is an equidigital number, since it uses as much as digits as its factorization.
111212210023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1322936.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 111212210023 its reverse (320012212111), we get a palindrome (431224422134).
The spelling of 111212210023 in words is "one hundred eleven billion, two hundred twelve million, two hundred ten thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.958 sec. • engine limits •