Base | Representation |
---|---|
bin | 10100100101100011… |
… | …00100001010110011 |
3 | 1001112021001011100110 |
4 | 22102301210022303 |
5 | 140113403320311 |
6 | 5024415152403 |
7 | 540613601256 |
oct | 122261441263 |
9 | 31467034313 |
10 | 11052401331 |
11 | 4761879784 |
12 | 2185515703 |
13 | 1071a43a5a |
14 | 76bc3109d |
15 | 44a4908a6 |
hex | 292c642b3 |
11052401331 has 8 divisors (see below), whose sum is σ = 14737138384. Its totient is φ = 7367965920.
The previous prime is 11052401329. The next prime is 11052401333. The reversal of 11052401331 is 13310425011.
It is an interprime number because it is at equal distance from previous prime (11052401329) and next prime (11052401333).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11052401331 - 21 = 11052401329 is a prime.
It is a super-2 number, since 2×110524013312 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11052401298 and 11052401307.
It is not an unprimeable number, because it can be changed into a prime (11052401333) 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, 31905 + ... + 152061.
It is an arithmetic number, because the mean of its divisors is an integer number (1842142298).
Almost surely, 211052401331 is an apocalyptic number.
11052401331 is a deficient number, since it is larger than the sum of its proper divisors (3684737053).
11052401331 is a wasteful number, since it uses less digits than its factorization.
11052401331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 150821.
The product of its (nonzero) digits is 360, while the sum is 21.
Adding to 11052401331 its reverse (13310425011), we get a palindrome (24362826342).
The spelling of 11052401331 in words is "eleven billion, fifty-two million, four hundred one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •