Base | Representation |
---|---|
bin | 10100111100011011… |
… | …01110000110011111 |
3 | 1002000122012012221101 |
4 | 22132031232012133 |
5 | 141012022101143 |
6 | 5055433013531 |
7 | 545434145233 |
oct | 123615560637 |
9 | 32018165841 |
10 | 11244331423 |
11 | 485014a696 |
12 | 22198542a7 |
13 | 10a2733b60 |
14 | 7895125c3 |
15 | 45c253b4d |
hex | 29e36e19f |
11244331423 has 16 divisors (see below), whose sum is σ = 12750448480. Its totient is φ = 9830139264.
The previous prime is 11244331393. The next prime is 11244331429. The reversal of 11244331423 is 32413344211.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 11244331423 - 225 = 11210776991 is a prime.
It is a super-3 number, since 3×112443314233 (a number of 31 digits) contains 333 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11244331391 and 11244331400.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11244331429) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1392265 + ... + 1400317.
It is an arithmetic number, because the mean of its divisors is an integer number (796903030).
Almost surely, 211244331423 is an apocalyptic number.
11244331423 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
11244331423 is a deficient number, since it is larger than the sum of its proper divisors (1506117057).
11244331423 is a wasteful number, since it uses less digits than its factorization.
11244331423 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13738.
The product of its digits is 6912, while the sum is 28.
Adding to 11244331423 its reverse (32413344211), we get a palindrome (43657675634).
The spelling of 11244331423 in words is "eleven billion, two hundred forty-four million, three hundred thirty-one thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •