Base | Representation |
---|---|
bin | 100001000111011… |
… | …1100011111000111 |
3 | 2212102221112001221 |
4 | 1002032330133013 |
5 | 4233432322043 |
6 | 302133101211 |
7 | 36352110013 |
oct | 10216743707 |
9 | 2772845057 |
10 | 1111214023 |
11 | 5202845a7 |
12 | 270187807 |
13 | 1492a8cba |
14 | a781b543 |
15 | 6784d8ed |
hex | 423bc7c7 |
1111214023 has 4 divisors (see below), whose sum is σ = 1112069448. Its totient is φ = 1110358600.
The previous prime is 1111213979. The next prime is 1111214029. The reversal of 1111214023 is 3204121111.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1111214023 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1111213988 and 1111214006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1111214029) 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 3 ways as a sum of consecutive naturals, for example, 425761 + ... + 428362.
It is an arithmetic number, because the mean of its divisors is an integer number (278017362).
Almost surely, 21111214023 is an apocalyptic number.
1111214023 is a deficient number, since it is larger than the sum of its proper divisors (855425).
1111214023 is an equidigital number, since it uses as much as digits as its factorization.
1111214023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 855424.
The product of its (nonzero) digits is 48, while the sum is 16.
The square root of 1111214023 is about 33334.8769759242. The cubic root of 1111214023 is about 1035.7761447807.
Adding to 1111214023 its reverse (3204121111), we get a palindrome (4315335134).
The spelling of 1111214023 in words is "one billion, one hundred eleven million, two hundred fourteen thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •