Base | Representation |
---|---|
bin | 10100100100011110… |
… | …11000011100100111 |
3 | 1001111122011220021222 |
4 | 22102033120130213 |
5 | 140104110043143 |
6 | 5023455130555 |
7 | 540444460211 |
oct | 122217303447 |
9 | 31448156258 |
10 | 11043440423 |
11 | 4757809274 |
12 | 2182513a5b |
13 | 106cc27142 |
14 | 76a97b5b1 |
15 | 4497c0768 |
hex | 2923d8727 |
11043440423 has 16 divisors (see below), whose sum is σ = 11303990880. Its totient is φ = 10786089600.
The previous prime is 11043440413. The next prime is 11043440449. The reversal of 11043440423 is 32404434011.
11043440423 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 11043440423 - 24 = 11043440407 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11043440392 and 11043440401.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11043440413) 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 15 ways as a sum of consecutive naturals, for example, 4716233 + ... + 4718573.
It is an arithmetic number, because the mean of its divisors is an integer number (706499430).
Almost surely, 211043440423 is an apocalyptic number.
11043440423 is a deficient number, since it is larger than the sum of its proper divisors (260550457).
11043440423 is a wasteful number, since it uses less digits than its factorization.
11043440423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2978.
The product of its (nonzero) digits is 4608, while the sum is 26.
Adding to 11043440423 its reverse (32404434011), we get a palindrome (43447874434).
The spelling of 11043440423 in words is "eleven billion, forty-three million, four hundred forty thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •