Base | Representation |
---|---|
bin | 10100100100010110… |
… | …00010010001011111 |
3 | 1001111120001000022222 |
4 | 22102023002101133 |
5 | 140103312113043 |
6 | 5023414455555 |
7 | 540432003305 |
oct | 122213022137 |
9 | 31446030288 |
10 | 11042301023 |
11 | 4757100216 |
12 | 21820645bb |
13 | 106c918640 |
14 | 76a762275 |
15 | 449647d68 |
hex | 2922c245f |
11042301023 has 8 divisors (see below), whose sum is σ = 12591221328. Its totient is φ = 9593311104.
The previous prime is 11042300999. The next prime is 11042301043. The reversal of 11042301023 is 32010324011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11042301023 - 28 = 11042300767 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11042300992 and 11042301010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11042301043) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 24982361 + ... + 24982802.
It is an arithmetic number, because the mean of its divisors is an integer number (1573902666).
Almost surely, 211042301023 is an apocalyptic number.
11042301023 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
11042301023 is a deficient number, since it is larger than the sum of its proper divisors (1548920305).
11042301023 is a wasteful number, since it uses less digits than its factorization.
11042301023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49965193.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 11042301023 its reverse (32010324011), we get a palindrome (43052625034).
The spelling of 11042301023 in words is "eleven billion, forty-two million, three hundred one thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •