Base | Representation |
---|---|
bin | 1010011010100010110000… |
… | …1001111001010011100101 |
3 | 1111112201100111022011000110 |
4 | 2212220230021321103211 |
5 | 3000103400120241121 |
6 | 40204323520003233 |
7 | 2261213342425521 |
oct | 246505411712345 |
9 | 44481314264013 |
10 | 11451123602661 |
11 | 371543781a6a6 |
12 | 134b37a160519 |
13 | 650ab4527c52 |
14 | 2b834738cd81 |
15 | 14cd0b3e1d76 |
hex | a6a2c2794e5 |
11451123602661 has 4 divisors (see below), whose sum is σ = 15268164803552. Its totient is φ = 7634082401772.
The previous prime is 11451123602599. The next prime is 11451123602747. The reversal of 11451123602661 is 16620632115411.
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 de Polignac number, because none of the positive numbers 2k-11451123602661 is a prime.
It is a super-2 number, since 2×114511236026612 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11451123602861) 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, 1908520600441 + ... + 1908520600446.
It is an arithmetic number, because the mean of its divisors is an integer number (3817041200888).
Almost surely, 211451123602661 is an apocalyptic number.
It is an amenable number.
11451123602661 is a deficient number, since it is larger than the sum of its proper divisors (3817041200891).
11451123602661 is an equidigital number, since it uses as much as digits as its factorization.
11451123602661 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3817041200890.
The product of its (nonzero) digits is 51840, while the sum is 39.
The spelling of 11451123602661 in words is "eleven trillion, four hundred fifty-one billion, one hundred twenty-three million, six hundred two thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •