Base | Representation |
---|---|
bin | 110011101100011011… |
… | …0010100010110111111 |
3 | 101121112122020011012221 |
4 | 1213120312110112333 |
5 | 3304323122101343 |
6 | 122555350510211 |
7 | 11006662661026 |
oct | 1473066242677 |
9 | 347478204187 |
10 | 111012300223 |
11 | 43097605270 |
12 | 19621965367 |
13 | a612152916 |
14 | 55318138bd |
15 | 2d4ae085ed |
hex | 19d8d945bf |
111012300223 has 4 divisors (see below), whose sum is σ = 121104327528. Its totient is φ = 100920272920.
The previous prime is 111012300211. The next prime is 111012300241. The reversal of 111012300223 is 322003210111.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 322003210111 = 11 ⋅29273019101.
It is a cyclic number.
It is not a de Polignac number, because 111012300223 - 221 = 111010203071 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 111012300197 and 111012300206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111012300023) 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, 5046013636 + ... + 5046013657.
It is an arithmetic number, because the mean of its divisors is an integer number (30276081882).
Almost surely, 2111012300223 is an apocalyptic number.
111012300223 is a deficient number, since it is larger than the sum of its proper divisors (10092027305).
111012300223 is a wasteful number, since it uses less digits than its factorization.
111012300223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10092027304.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 111012300223 its reverse (322003210111), we get a palindrome (433015510334).
The spelling of 111012300223 in words is "one hundred eleven billion, twelve million, three hundred thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •