Base | Representation |
---|---|
bin | 10100100100000111… |
… | …11001011111001111 |
3 | 1001111102111221210222 |
4 | 22102003321133033 |
5 | 140102322230111 |
6 | 5023310421555 |
7 | 540410051441 |
oct | 122203713717 |
9 | 31442457728 |
10 | 11040430031 |
11 | 4756042544 |
12 | 21815018bb |
13 | 106c411b47 |
14 | 76a3d6491 |
15 | 4493c87db |
hex | 2920f97cf |
11040430031 has 8 divisors (see below), whose sum is σ = 11584101984. Its totient is φ = 10502062560.
The previous prime is 11040429989. The next prime is 11040430067. The reversal of 11040430031 is 13003404011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11040430031 - 214 = 11040413647 is a prime.
It is a super-2 number, since 2×110404300312 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11040429991 and 11040430009.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11040432031) 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 7 ways as a sum of consecutive naturals, for example, 1321856 + ... + 1330181.
It is an arithmetic number, because the mean of its divisors is an integer number (1448012748).
Almost surely, 211040430031 is an apocalyptic number.
11040430031 is a deficient number, since it is larger than the sum of its proper divisors (543671953).
11040430031 is a wasteful number, since it uses less digits than its factorization.
11040430031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2652241.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 11040430031 its reverse (13003404011), we get a palindrome (24043834042).
The spelling of 11040430031 in words is "eleven billion, forty million, four hundred thirty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •