Base | Representation |
---|---|
bin | 10011011100100011… |
… | …10111001110100011 |
3 | 222221120220120221012 |
4 | 21232101313032203 |
5 | 132340132023021 |
6 | 4443543451135 |
7 | 516500323301 |
oct | 115621671643 |
9 | 28846816835 |
10 | 10440111011 |
11 | 4478196a20 |
12 | 2034456aab |
13 | ca4c33ca5 |
14 | 7107a9271 |
15 | 41184635b |
hex | 26e4773a3 |
10440111011 has 4 divisors (see below), whose sum is σ = 11389212024. Its totient is φ = 9491010000.
The previous prime is 10440111001. The next prime is 10440111053. The reversal of 10440111011 is 11011104401.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 10440111011 - 226 = 10373002147 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10440111001) 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 3 ways as a sum of consecutive naturals, for example, 474550490 + ... + 474550511.
It is an arithmetic number, because the mean of its divisors is an integer number (2847303006).
Almost surely, 210440111011 is an apocalyptic number.
10440111011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
10440111011 is a deficient number, since it is larger than the sum of its proper divisors (949101013).
10440111011 is an equidigital number, since it uses as much as digits as its factorization.
10440111011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 949101012.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 10440111011 its reverse (11011104401), we get a palindrome (21451215412).
It can be divided in two parts, 104401 and 11011, that multiplied together give a palindrome (1149559411).
The spelling of 10440111011 in words is "ten billion, four hundred forty million, one hundred eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •