Base | Representation |
---|---|
bin | 10100101011011001… |
… | …00100001101100111 |
3 | 1001122200021200200001 |
4 | 22111230210031213 |
5 | 140213431004224 |
6 | 5033330002131 |
7 | 542050351042 |
oct | 122554441547 |
9 | 31580250601 |
10 | 11101422439 |
11 | 4787510a98 |
12 | 2199a16347 |
13 | 107bc48723 |
14 | 774551c59 |
15 | 44e925544 |
hex | 295b24367 |
11101422439 has 4 divisors (see below), whose sum is σ = 11110823640. Its totient is φ = 11092021240.
The previous prime is 11101422427. The next prime is 11101422457. The reversal of 11101422439 is 93422410111.
11101422439 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 93422410111 = 37 ⋅2524930003.
It is a cyclic number.
It is not a de Polignac number, because 11101422439 - 25 = 11101422407 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11101422499) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4698829 + ... + 4701190.
It is an arithmetic number, because the mean of its divisors is an integer number (2777705910).
Almost surely, 211101422439 is an apocalyptic number.
11101422439 is a deficient number, since it is larger than the sum of its proper divisors (9401201).
11101422439 is an equidigital number, since it uses as much as digits as its factorization.
11101422439 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9401200.
The product of its (nonzero) digits is 1728, while the sum is 28.
The spelling of 11101422439 in words is "eleven billion, one hundred one million, four hundred twenty-two thousand, four hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •