Base | Representation |
---|---|
bin | 110011110110110110… |
… | …1000101000111101001 |
3 | 101122110000121220112110 |
4 | 1213231231011013221 |
5 | 3311032210400131 |
6 | 123054210232533 |
7 | 11021442040101 |
oct | 1475555050751 |
9 | 348400556473 |
10 | 111362200041 |
11 | 43257071174 |
12 | 196bab85749 |
13 | a6697a2331 |
14 | 5566096201 |
15 | 2d6b9c2646 |
hex | 19edb451e9 |
111362200041 has 8 divisors (see below), whose sum is σ = 148754385184. Its totient is φ = 74105740800.
The previous prime is 111362199973. The next prime is 111362200043. The reversal of 111362200041 is 140002263111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 111362200041 - 225 = 111328645609 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 111362199990 and 111362200017.
It is not an unprimeable number, because it can be changed into a prime (111362200043) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 33929560 + ... + 33932841.
It is an arithmetic number, because the mean of its divisors is an integer number (18594298148).
Almost surely, 2111362200041 is an apocalyptic number.
It is an amenable number.
111362200041 is a deficient number, since it is larger than the sum of its proper divisors (37392185143).
111362200041 is an equidigital number, since it uses as much as digits as its factorization.
111362200041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 67862951.
The product of its (nonzero) digits is 288, while the sum is 21.
Adding to 111362200041 its reverse (140002263111), we get a palindrome (251364463152).
The spelling of 111362200041 in words is "one hundred eleven billion, three hundred sixty-two million, two hundred thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •