Base | Representation |
---|---|
bin | 1100001111011110110011… |
… | …0011000010010011110001 |
3 | 1202122202212212212112112101 |
4 | 3003313230303002103301 |
5 | 3231012243431341040 |
6 | 44343253110500401 |
7 | 2556313646433262 |
oct | 303675463022361 |
9 | 52582785775471 |
10 | 13460105340145 |
11 | 431a442618822 |
12 | 16147aa064701 |
13 | 768389816c89 |
14 | 347688a5c969 |
15 | 1851dcb9009a |
hex | c3deccc24f1 |
13460105340145 has 8 divisors (see below), whose sum is σ = 16356583704960. Its totient is φ = 10631779407600.
The previous prime is 13460105340067. The next prime is 13460105340191. The reversal of 13460105340145 is 54104350106431.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 13460105340145 - 239 = 12910349526257 is a prime.
It is a super-2 number, since 2×134601053401452 (a number of 27 digits) contains 22 as substring.
It is an unprimeable number.
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, 17038107631 + ... + 17038108420.
It is an arithmetic number, because the mean of its divisors is an integer number (2044572963120).
Almost surely, 213460105340145 is an apocalyptic number.
It is an amenable number.
13460105340145 is a deficient number, since it is larger than the sum of its proper divisors (2896478364815).
13460105340145 is an equidigital number, since it uses as much as digits as its factorization.
13460105340145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34076216135.
The product of its (nonzero) digits is 86400, while the sum is 37.
Adding to 13460105340145 its reverse (54104350106431), we get a palindrome (67564455446576).
The spelling of 13460105340145 in words is "thirteen trillion, four hundred sixty billion, one hundred five million, three hundred forty thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •