Base | Representation |
---|---|
bin | 110011111001010001… |
… | …0110110010111000111 |
3 | 101122122200102111202001 |
4 | 1213302202312113013 |
5 | 3311214002413411 |
6 | 123110230530131 |
7 | 11023446210025 |
oct | 1476242662707 |
9 | 348580374661 |
10 | 111443404231 |
11 | 43298995075 |
12 | 19722206947 |
13 | a680564853 |
14 | 5572b93715 |
15 | 2d73bb2dc1 |
hex | 19f28b65c7 |
111443404231 has 4 divisors (see below), whose sum is σ = 111445855632. Its totient is φ = 111440952832.
The previous prime is 111443404229. The next prime is 111443404271. The reversal of 111443404231 is 132404344111.
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 111443404231 - 21 = 111443404229 is a prime.
It is a super-2 number, since 2×1114434042312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 111443404231.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111443404201) 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, 1156195 + ... + 1248868.
It is an arithmetic number, because the mean of its divisors is an integer number (27861463908).
Almost surely, 2111443404231 is an apocalyptic number.
111443404231 is a deficient number, since it is larger than the sum of its proper divisors (2451401).
111443404231 is an equidigital number, since it uses as much as digits as its factorization.
111443404231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2451400.
The product of its (nonzero) digits is 4608, while the sum is 28.
Adding to 111443404231 its reverse (132404344111), we get a palindrome (243847748342).
The spelling of 111443404231 in words is "one hundred eleven billion, four hundred forty-three million, four hundred four thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •