Base | Representation |
---|---|
bin | 110011111000101101… |
… | …0010110101010100001 |
3 | 101122121100122222212212 |
4 | 1213301122112222201 |
5 | 3311144121300113 |
6 | 123104311331505 |
7 | 11023125526142 |
oct | 1476132265241 |
9 | 348540588785 |
10 | 111424400033 |
11 | 43289194a21 |
12 | 19717980b95 |
13 | a67963c76b |
14 | 5570447ac9 |
15 | 2d721ac0a8 |
hex | 19f1696aa1 |
111424400033 has 8 divisors (see below), whose sum is σ = 118701962400. Its totient is φ = 104288149728.
The previous prime is 111424400029. The next prime is 111424400077. The reversal of 111424400033 is 330004424111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 111424400033 - 22 = 111424400029 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 111424399981 and 111424400008.
It is not an unprimeable number, because it can be changed into a prime (111424400233) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 35326388 + ... + 35329541.
It is an arithmetic number, because the mean of its divisors is an integer number (14837745300).
Almost surely, 2111424400033 is an apocalyptic number.
It is an amenable number.
111424400033 is a deficient number, since it is larger than the sum of its proper divisors (7277562367).
111424400033 is an equidigital number, since it uses as much as digits as its factorization.
111424400033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 70656031.
The product of its (nonzero) digits is 1152, while the sum is 23.
Adding to 111424400033 its reverse (330004424111), we get a palindrome (441428824144).
The spelling of 111424400033 in words is "one hundred eleven billion, four hundred twenty-four million, four hundred thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •