Base | Representation |
---|---|
bin | 1010011010001010000110… |
… | …1100000000110101110101 |
3 | 1111112002021021021001010112 |
4 | 2212202201230000311311 |
5 | 3000001321404433401 |
6 | 40201311104032405 |
7 | 2260560342035135 |
oct | 246424154006565 |
9 | 44462237231115 |
10 | 11444505546101 |
11 | 3712651028871 |
12 | 134a031902705 |
13 | 65029b3b0954 |
14 | 2b7cba456ac5 |
15 | 14ca703c13bb |
hex | a68a1b00d75 |
11444505546101 has 4 divisors (see below), whose sum is σ = 11444589074400. Its totient is φ = 11444422017804.
The previous prime is 11444505546043. The next prime is 11444505546109. The reversal of 11444505546101 is 10164550544411.
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 11444505546101 - 242 = 7046459034997 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 (11444505546109) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 41558291 + ... + 41832768.
It is an arithmetic number, because the mean of its divisors is an integer number (2861147268600).
Almost surely, 211444505546101 is an apocalyptic number.
It is an amenable number.
11444505546101 is a deficient number, since it is larger than the sum of its proper divisors (83528299).
11444505546101 is an equidigital number, since it uses as much as digits as its factorization.
11444505546101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 83528298.
The product of its (nonzero) digits is 192000, while the sum is 41.
The spelling of 11444505546101 in words is "eleven trillion, four hundred forty-four billion, five hundred five million, five hundred forty-six thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •