Base | Representation |
---|---|
bin | 1100011010000011001001… |
… | …0111011010101010111011 |
3 | 1210022010111211010100020021 |
4 | 3012200302113122222323 |
5 | 3242001110222201301 |
6 | 45002520445311311 |
7 | 2605402036256143 |
oct | 306406227325273 |
9 | 53263454110207 |
10 | 13641661131451 |
11 | 438a43a086a41 |
12 | 1643a18865537 |
13 | 77c531885ba2 |
14 | 35238d321923 |
15 | 189cb6c638a1 |
hex | c68325daabb |
13641661131451 has 8 divisors (see below), whose sum is σ = 13677762384000. Its totient is φ = 13605606857472.
The previous prime is 13641661131431. The next prime is 13641661131473. The reversal of 13641661131451 is 15413116614631.
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 13641661131451 - 211 = 13641661129403 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13641661131398 and 13641661131407.
It is not an unprimeable number, because it can be changed into a prime (13641661131401) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 11163076 + ... + 12324673.
It is an arithmetic number, because the mean of its divisors is an integer number (1709720298000).
Almost surely, 213641661131451 is an apocalyptic number.
13641661131451 is a deficient number, since it is larger than the sum of its proper divisors (36101252549).
13641661131451 is an equidigital number, since it uses as much as digits as its factorization.
13641661131451 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23489285.
The product of its digits is 155520, while the sum is 43.
The spelling of 13641661131451 in words is "thirteen trillion, six hundred forty-one billion, six hundred sixty-one million, one hundred thirty-one thousand, four hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •