Base | Representation |
---|---|
bin | 1100001110100110111010… |
… | …0110001001011011100101 |
3 | 1202121100011100120022120020 |
4 | 3003221232212021123211 |
5 | 3230241032400132331 |
6 | 44332332313225353 |
7 | 2555243121651261 |
oct | 303515646113345 |
9 | 52540140508506 |
10 | 13445103130341 |
11 | 4314044227523 |
12 | 1611901a02259 |
13 | 766b386a615c |
14 | 346a644210a1 |
15 | 184b10a90c96 |
hex | c3a6e9896e5 |
13445103130341 has 8 divisors (see below), whose sum is σ = 17955858964224. Its totient is φ = 8948874691680.
The previous prime is 13445103130289. The next prime is 13445103130343. The reversal of 13445103130341 is 14303130154431.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 13445103130341 - 27 = 13445103130213 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13445103130343) 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, 3631846645 + ... + 3631850346.
It is an arithmetic number, because the mean of its divisors is an integer number (2244482370528).
Almost surely, 213445103130341 is an apocalyptic number.
It is an amenable number.
13445103130341 is a deficient number, since it is larger than the sum of its proper divisors (4510755833883).
13445103130341 is an equidigital number, since it uses as much as digits as its factorization.
13445103130341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7263697611.
The product of its (nonzero) digits is 25920, while the sum is 33.
Adding to 13445103130341 its reverse (14303130154431), we get a palindrome (27748233284772).
The spelling of 13445103130341 in words is "thirteen trillion, four hundred forty-five billion, one hundred three million, one hundred thirty thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •