Base | Representation |
---|---|
bin | 10000001010111001111… |
… | …000010100101101011111 |
3 | 10221020020211200112011201 |
4 | 100022321320110231133 |
5 | 121201234322042343 |
6 | 2210253143300331 |
7 | 143166033051664 |
oct | 20127170245537 |
9 | 3836224615151 |
10 | 1111220112223 |
11 | 3992a1869411 |
12 | 15b44144a6a7 |
13 | 80a314ac430 |
14 | 3bad76b3a6b |
15 | 1dd8aa1d94d |
hex | 102b9e14b5f |
1111220112223 has 16 divisors (see below), whose sum is σ = 1202880762720. Its totient is φ = 1020450299904.
The previous prime is 1111220112181. The next prime is 1111220112227. The reversal of 1111220112223 is 3222110221111.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1111220112223 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1111220112223.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1111220112227) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3333348 + ... + 3651526.
It is an arithmetic number, because the mean of its divisors is an integer number (75180047670).
Almost surely, 21111220112223 is an apocalyptic number.
1111220112223 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
1111220112223 is a deficient number, since it is larger than the sum of its proper divisors (91660650497).
1111220112223 is a wasteful number, since it uses less digits than its factorization.
1111220112223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 319578.
The product of its (nonzero) digits is 96, while the sum is 19.
Adding to 1111220112223 its reverse (3222110221111), we get a palindrome (4333330333334).
The spelling of 1111220112223 in words is "one trillion, one hundred eleven billion, two hundred twenty million, one hundred twelve thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •