Base | Representation |
---|---|
bin | 110011101101100101… |
… | …0110010111111110111 |
3 | 101121122100110122021102 |
4 | 1213123022302333313 |
5 | 3304413103114111 |
6 | 123003301040315 |
7 | 11010644551430 |
oct | 1473312627767 |
9 | 347570418242 |
10 | 111051223031 |
11 | 4310757a581 |
12 | 196329b609b |
13 | a61a230078 |
14 | 5536a66487 |
15 | 2d4e54613b |
hex | 19db2b2ff7 |
111051223031 has 4 divisors (see below), whose sum is σ = 126915683472. Its totient is φ = 95186762592.
The previous prime is 111051222991. The next prime is 111051223057. The reversal of 111051223031 is 130322150111.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 111051223031 - 226 = 110984114167 is a prime.
It is a super-2 number, since 2×1110512230312 (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 = 111051222994 and 111051223012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111051223531) 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, 7932230210 + ... + 7932230223.
It is an arithmetic number, because the mean of its divisors is an integer number (31728920868).
Almost surely, 2111051223031 is an apocalyptic number.
111051223031 is a deficient number, since it is larger than the sum of its proper divisors (15864460441).
111051223031 is an equidigital number, since it uses as much as digits as its factorization.
111051223031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15864460440.
The product of its (nonzero) digits is 180, while the sum is 20.
Adding to 111051223031 its reverse (130322150111), we get a palindrome (241373373142).
The spelling of 111051223031 in words is "one hundred eleven billion, fifty-one million, two hundred twenty-three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •