Base | Representation |
---|---|
bin | 110011101111000110… |
… | …0111101010101100111 |
3 | 101121202220020112121012 |
4 | 1213132030331111213 |
5 | 3310014120340234 |
6 | 123012320012435 |
7 | 11012133310100 |
oct | 1473614752547 |
9 | 347686215535 |
10 | 111102121319 |
11 | 43133284182 |
12 | 19647a6111b |
13 | a6279412b7 |
14 | 553d7153a7 |
15 | 2d53c4c0ce |
hex | 19de33d567 |
111102121319 has 6 divisors (see below), whose sum is σ = 129241243224. Its totient is φ = 95230389660.
The previous prime is 111102121297. The next prime is 111102121321. The reversal of 111102121319 is 913121201111.
It is not a de Polignac number, because 111102121319 - 212 = 111102117223 is a prime.
It is a super-2 number, since 2×1111021213192 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 111102121294 and 111102121303.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111102121379) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 1133695067 + ... + 1133695164.
It is an arithmetic number, because the mean of its divisors is an integer number (21540207204).
Almost surely, 2111102121319 is an apocalyptic number.
111102121319 is a deficient number, since it is larger than the sum of its proper divisors (18139121905).
111102121319 is an equidigital number, since it uses as much as digits as its factorization.
111102121319 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2267390245 (or 2267390238 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 23.
The spelling of 111102121319 in words is "one hundred eleven billion, one hundred two million, one hundred twenty-one thousand, three hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •