Base | Representation |
---|---|
bin | 1010011011011011110101… |
… | …1010011111010000111101 |
3 | 1111121011220022020202022201 |
4 | 2212312331122133100331 |
5 | 3000331240030110103 |
6 | 40215340134311501 |
7 | 2262265132016032 |
oct | 246667532372075 |
9 | 44534808222281 |
10 | 11466445550653 |
11 | 372098a646a35 |
12 | 13523354b8591 |
13 | 652386987a72 |
14 | 2b8d9c25b389 |
15 | 14d4065ed51d |
hex | a6dbd69f43d |
11466445550653 has 4 divisors (see below), whose sum is σ = 11467758862048. Its totient is φ = 11465132239260.
The previous prime is 11466445550647. The next prime is 11466445550671. The reversal of 11466445550653 is 35605554466411.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 11466445550653 - 29 = 11466445550141 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11466445550594 and 11466445550603.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11466445551653) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 656642601 + ... + 656660062.
It is an arithmetic number, because the mean of its divisors is an integer number (2866939715512).
Almost surely, 211466445550653 is an apocalyptic number.
It is an amenable number.
11466445550653 is a deficient number, since it is larger than the sum of its proper divisors (1313311395).
11466445550653 is an equidigital number, since it uses as much as digits as its factorization.
11466445550653 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1313311394.
The product of its (nonzero) digits is 25920000, while the sum is 55.
The spelling of 11466445550653 in words is "eleven trillion, four hundred sixty-six billion, four hundred forty-five million, five hundred fifty thousand, six hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •