Base | Representation |
---|---|
bin | 1011111101000111000111… |
… | …1011110110100100001001 |
3 | 1201112121021121021100212001 |
4 | 2333101301323312210021 |
5 | 3210324424412104121 |
6 | 43542301042151001 |
7 | 2524442150522362 |
oct | 277216173664411 |
9 | 51477247240761 |
10 | 13144511441161 |
11 | 4208613039401 |
12 | 15835b2352461 |
13 | 7446a30cb709 |
14 | 3362aa89ab69 |
15 | 17bdbb4a6991 |
hex | bf471ef6909 |
13144511441161 has 8 divisors (see below), whose sum is σ = 13161163320800. Its totient is φ = 13127862702240.
The previous prime is 13144511441153. The next prime is 13144511441197. The reversal of 13144511441161 is 16114411544131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 13144511441161 - 23 = 13144511441153 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 13144511441161.
It is not an unprimeable number, because it can be changed into a prime (13144511441101) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7647805 + ... + 9207493.
It is an arithmetic number, because the mean of its divisors is an integer number (1645145415100).
Almost surely, 213144511441161 is an apocalyptic number.
It is an amenable number.
13144511441161 is a deficient number, since it is larger than the sum of its proper divisors (16651879639).
13144511441161 is an equidigital number, since it uses as much as digits as its factorization.
13144511441161 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1570359.
The product of its digits is 23040, while the sum is 37.
Adding to 13144511441161 its reverse (16114411544131), we get a palindrome (29258922985292).
The spelling of 13144511441161 in words is "thirteen trillion, one hundred forty-four billion, five hundred eleven million, four hundred forty-one thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •