Base | Representation |
---|---|
bin | 10101101010100100… |
… | …10010100011000101 |
3 | 1010000121112121102011 |
4 | 22311102102203011 |
5 | 142310114432003 |
6 | 5202101214221 |
7 | 561144212326 |
oct | 126522224305 |
9 | 33017477364 |
10 | 11631405253 |
11 | 4a29696a16 |
12 | 2307401371 |
13 | 113499aa20 |
14 | 7c4ab044d |
15 | 48121246d |
hex | 2b54928c5 |
11631405253 has 24 divisors (see below), whose sum is σ = 13332138120. Its totient is φ = 10085498880.
The previous prime is 11631405241. The next prime is 11631405257. The reversal of 11631405253 is 35250413611.
It can be written as a sum of positive squares in 12 ways, for example, as 1428991204 + 10202414049 = 37802^2 + 101007^2 .
It is not a de Polignac number, because 11631405253 - 213 = 11631397061 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11631405257) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2135013 + ... + 2140453.
It is an arithmetic number, because the mean of its divisors is an integer number (555505755).
Almost surely, 211631405253 is an apocalyptic number.
11631405253 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
11631405253 is a deficient number, since it is larger than the sum of its proper divisors (1700732867).
11631405253 is a wasteful number, since it uses less digits than its factorization.
11631405253 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6057 (or 6040 counting only the distinct ones).
The product of its (nonzero) digits is 10800, while the sum is 31.
Adding to 11631405253 its reverse (35250413611), we get a palindrome (46881818864).
The spelling of 11631405253 in words is "eleven billion, six hundred thirty-one million, four hundred five thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •