Base | Representation |
---|---|
bin | 10011011100101000… |
… | …10011000110011011 |
3 | 222221122010000201201 |
4 | 21232110103012123 |
5 | 132340312440332 |
6 | 4444005255031 |
7 | 516505622551 |
oct | 115624230633 |
9 | 28848100651 |
10 | 10440749467 |
11 | 4478592675 |
12 | 2034704477 |
13 | ca50c8785 |
14 | 7108d3bd1 |
15 | 4119205e7 |
hex | 26e51319b |
10440749467 has 4 divisors (see below), whose sum is σ = 10894695120. Its totient is φ = 9986803816.
The previous prime is 10440749437. The next prime is 10440749471. The reversal of 10440749467 is 76494704401.
It is a happy number.
10440749467 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: 76494704401 = 1913 ⋅39986777.
It is a cyclic number.
It is not a de Polignac number, because 10440749467 - 219 = 10440225179 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10440749437) 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, 226972792 + ... + 226972837.
It is an arithmetic number, because the mean of its divisors is an integer number (2723673780).
Almost surely, 210440749467 is an apocalyptic number.
10440749467 is a deficient number, since it is larger than the sum of its proper divisors (453945653).
10440749467 is an equidigital number, since it uses as much as digits as its factorization.
10440749467 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 453945652.
The product of its (nonzero) digits is 677376, while the sum is 46.
The spelling of 10440749467 in words is "ten billion, four hundred forty million, seven hundred forty-nine thousand, four hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •