Base | Representation |
---|---|
bin | 1010000000110111111011… |
… | …1010110101010101000101 |
3 | 1102222120001221001000012110 |
4 | 2200031332322311111011 |
5 | 2420342221404003103 |
6 | 35225552324011233 |
7 | 2214312204242121 |
oct | 240157672652505 |
9 | 42876057030173 |
10 | 11010130531653 |
11 | 3565408719320 |
12 | 1299a06530b19 |
13 | 61b335184c96 |
14 | 2a0c70b96581 |
15 | 1415eac4d403 |
hex | a037eeb5545 |
11010130531653 has 32 divisors (see below), whose sum is σ = 16234582210560. Its totient is φ = 6581381938560.
The previous prime is 11010130531637. The next prime is 11010130531667. The reversal of 11010130531653 is 35613503101011.
It is not a de Polignac number, because 11010130531653 - 24 = 11010130531637 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11010130531653.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11010130536653) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 239001 + ... + 4698657.
It is an arithmetic number, because the mean of its divisors is an integer number (507330694080).
Almost surely, 211010130531653 is an apocalyptic number.
It is an amenable number.
11010130531653 is a deficient number, since it is larger than the sum of its proper divisors (5224451678907).
11010130531653 is a wasteful number, since it uses less digits than its factorization.
11010130531653 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4460697.
The product of its (nonzero) digits is 4050, while the sum is 30.
Adding to 11010130531653 its reverse (35613503101011), we get a palindrome (46623633632664).
The spelling of 11010130531653 in words is "eleven trillion, ten billion, one hundred thirty million, five hundred thirty-one thousand, six hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •