Base | Representation |
---|---|
bin | 110011101101010110… |
… | …0101011111111101000 |
3 | 101121121210121122002211 |
4 | 1213122230223333220 |
5 | 3304404043030044 |
6 | 123002415534504 |
7 | 11010520505644 |
oct | 1473254537750 |
9 | 347553548084 |
10 | 111043330024 |
11 | 43103079430 |
12 | 1963022a434 |
13 | a6186c8553 |
14 | 55359adc24 |
15 | 2d4d9d7634 |
hex | 19dab2bfe8 |
111043330024 has 32 divisors (see below), whose sum is σ = 234460995840. Its totient is φ = 48846038400.
The previous prime is 111043330009. The next prime is 111043330031. The reversal of 111043330024 is 420033340111.
It is a super-2 number, since 2×1110433300242 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is a junction number, because it is equal to n+sod(n) for n = 111043329977 and 111043330004.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 20349789 + ... + 20355244.
It is an arithmetic number, because the mean of its divisors is an integer number (7326906120).
Almost surely, 2111043330024 is an apocalyptic number.
It is an amenable number.
111043330024 is an abundant number, since it is smaller than the sum of its proper divisors (123417665816).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
111043330024 is a wasteful number, since it uses less digits than its factorization.
111043330024 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40705081 (or 40705077 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 111043330024 its reverse (420033340111), we get a palindrome (531076670135).
The spelling of 111043330024 in words is "one hundred eleven billion, forty-three million, three hundred thirty thousand, twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •