Base | Representation |
---|---|
bin | 110011111001000000… |
… | …0001111010001010111 |
3 | 101122122001100112220201 |
4 | 1213302000033101113 |
5 | 3311204142044343 |
6 | 123105304241331 |
7 | 11023306121065 |
oct | 1476200172127 |
9 | 348561315821 |
10 | 111434331223 |
11 | 43293858416 |
12 | 1971b170247 |
13 | a67b708bc7 |
14 | 55718b1035 |
15 | 2d72ebe94d |
hex | 19f200f457 |
111434331223 has 4 divisors (see below), whose sum is σ = 112247720640. Its totient is φ = 110620941808.
The previous prime is 111434331221. The next prime is 111434331247. The reversal of 111434331223 is 322133434111.
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 111434331223 - 21 = 111434331221 is a prime.
It is a super-2 number, since 2×1114343312232 (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 = 111434331191 and 111434331200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111434331221) 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, 406694503 + ... + 406694776.
It is an arithmetic number, because the mean of its divisors is an integer number (28061930160).
Almost surely, 2111434331223 is an apocalyptic number.
111434331223 is a deficient number, since it is larger than the sum of its proper divisors (813389417).
111434331223 is an equidigital number, since it uses as much as digits as its factorization.
111434331223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 813389416.
The product of its digits is 5184, while the sum is 28.
Adding to 111434331223 its reverse (322133434111), we get a palindrome (433567765334).
The spelling of 111434331223 in words is "one hundred eleven billion, four hundred thirty-four million, three hundred thirty-one thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •