Base | Representation |
---|---|
bin | 1010100101001001100001… |
… | …0011001100001011111101 |
3 | 1112012010122112101200102022 |
4 | 2221102120103030023331 |
5 | 3011100023102330203 |
6 | 40424135414405525 |
7 | 2310323451411236 |
oct | 251223023141375 |
9 | 45163575350368 |
10 | 11633326605053 |
11 | 378573665210a |
12 | 137a7496608a5 |
13 | 6650306b25ba |
14 | 2c30ad9a808d |
15 | 15292220ba38 |
hex | a94984cc2fd |
11633326605053 has 48 divisors (see below), whose sum is σ = 13120050240000. Its totient is φ = 10294696995840.
The previous prime is 11633326605049. The next prime is 11633326605059. The reversal of 11633326605053 is 35050662333611.
It is not a de Polignac number, because 11633326605053 - 22 = 11633326605049 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11633326604995 and 11633326605013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11633326605059) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 234996698 + ... + 235046196.
It is an arithmetic number, because the mean of its divisors is an integer number (273334380000).
Almost surely, 211633326605053 is an apocalyptic number.
It is an amenable number.
11633326605053 is a deficient number, since it is larger than the sum of its proper divisors (1486723634947).
11633326605053 is a wasteful number, since it uses less digits than its factorization.
11633326605053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50310 (or 50293 counting only the distinct ones).
The product of its (nonzero) digits is 874800, while the sum is 44.
Adding to 11633326605053 its reverse (35050662333611), we get a palindrome (46683988938664).
The spelling of 11633326605053 in words is "eleven trillion, six hundred thirty-three billion, three hundred twenty-six million, six hundred five thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •