Base | Representation |
---|---|
bin | 110011110000010100… |
… | …1110010001000011111 |
3 | 101121212202121011220011 |
4 | 1213200221302020133 |
5 | 3310110131411111 |
6 | 123020345104051 |
7 | 11013142612306 |
oct | 1474051621037 |
9 | 347782534804 |
10 | 111143232031 |
11 | 43154503277 |
12 | 19659788027 |
13 | a633306570 |
14 | 5544d7743d |
15 | 2d5766d021 |
hex | 19e0a7221f |
111143232031 has 4 divisors (see below), whose sum is σ = 119692711432. Its totient is φ = 102593752632.
The previous prime is 111143231977. The next prime is 111143232103. The reversal of 111143232031 is 130232341111.
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 111143232031 - 29 = 111143231519 is a prime.
It is a super-2 number, since 2×1111432320312 (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 = 111143231993 and 111143232011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111143236031) 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, 4274739681 + ... + 4274739706.
It is an arithmetic number, because the mean of its divisors is an integer number (29923177858).
Almost surely, 2111143232031 is an apocalyptic number.
111143232031 is a deficient number, since it is larger than the sum of its proper divisors (8549479401).
111143232031 is an equidigital number, since it uses as much as digits as its factorization.
111143232031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8549479400.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 111143232031 its reverse (130232341111), we get a palindrome (241375573142).
The spelling of 111143232031 in words is "one hundred eleven billion, one hundred forty-three million, two hundred thirty-two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •