Base | Representation |
---|---|
bin | 10100100010001100… |
… | …11101010110111111 |
3 | 1001110022012200112110 |
4 | 22101012131112333 |
5 | 140034211332111 |
6 | 5021533305103 |
7 | 540123131250 |
oct | 122106352677 |
9 | 31408180473 |
10 | 11024324031 |
11 | 4747a418a6 |
12 | 2178035193 |
13 | 1068c92c76 |
14 | 768202b27 |
15 | 447c965a6 |
hex | 29119d5bf |
11024324031 has 16 divisors (see below), whose sum is σ = 16811923968. Its totient is φ = 6294756000.
The previous prime is 11024323997. The next prime is 11024324041. The reversal of 11024324031 is 13042342011.
It is not a de Polignac number, because 11024324031 - 215 = 11024291263 is a prime.
It is a super-2 number, since 2×110243240312 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a junction number, because it is equal to n+sod(n) for n = 11024323989 and 11024324007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11024324041) 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 15 ways as a sum of consecutive naturals, for example, 174435 + ... + 229076.
It is an arithmetic number, because the mean of its divisors is an integer number (1050745248).
Almost surely, 211024324031 is an apocalyptic number.
11024324031 is a deficient number, since it is larger than the sum of its proper divisors (5787599937).
11024324031 is a wasteful number, since it uses less digits than its factorization.
11024324031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 404822.
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 11024324031 its reverse (13042342011), we get a palindrome (24066666042).
The spelling of 11024324031 in words is "eleven billion, twenty-four million, three hundred twenty-four thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •