Base | Representation |
---|---|
bin | 10100111100011110… |
… | …00010101010010011 |
3 | 1002000122211211001101 |
4 | 22132033002222103 |
5 | 141012114142104 |
6 | 5055444245231 |
7 | 545440120066 |
oct | 123617025223 |
9 | 32018754041 |
10 | 11244677779 |
11 | 4850366935 |
12 | 22199a0817 |
13 | 10a28256ba |
14 | 7895a28dd |
15 | 45c2c15a4 |
hex | 29e3c2a93 |
11244677779 has 4 divisors (see below), whose sum is σ = 11291726880. Its totient is φ = 11197628680.
The previous prime is 11244677777. The next prime is 11244677797. The reversal of 11244677779 is 97777644211.
11244677779 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: 97777644211 = 13 ⋅7521357247.
It is a cyclic number.
It is not a de Polignac number, because 11244677779 - 21 = 11244677777 is a prime.
It is a Duffinian number.
It is a plaindrome in base 10.
It is not an unprimeable number, because it can be changed into a prime (11244677777) 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, 23524192 + ... + 23524669.
It is an arithmetic number, because the mean of its divisors is an integer number (2822931720).
Almost surely, 211244677779 is an apocalyptic number.
11244677779 is a deficient number, since it is larger than the sum of its proper divisors (47049101).
11244677779 is an equidigital number, since it uses as much as digits as its factorization.
11244677779 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47049100.
The product of its digits is 4148928, while the sum is 55.
The spelling of 11244677779 in words is "eleven billion, two hundred forty-four million, six hundred seventy-seven thousand, seven hundred seventy-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •