Base | Representation |
---|---|
bin | 1100001001010011100010… |
… | …1110100100000000000001 |
3 | 1202021122000120110112010002 |
4 | 3002110320232210000001 |
5 | 3222243000243202231 |
6 | 44222424545245345 |
7 | 2545536460041323 |
oct | 302247056440001 |
9 | 52248016415102 |
10 | 13354005053441 |
11 | 4289446794a68 |
12 | 15b8119333855 |
13 | 75b37b227640 |
14 | 3424a1765613 |
15 | 18257d10d0cb |
hex | c2538ba4001 |
13354005053441 has 8 divisors (see below), whose sum is σ = 15006507351360. Its totient is φ = 11790827204112.
The previous prime is 13354005053437. The next prime is 13354005053497. The reversal of 13354005053441 is 14435050045331.
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 13354005053441 - 22 = 13354005053437 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13354005053395 and 13354005053404.
It is not an unprimeable number, because it can be changed into a prime (13354005059441) 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, 22331111831 + ... + 22331112428.
It is an arithmetic number, because the mean of its divisors is an integer number (1875813418920).
Almost surely, 213354005053441 is an apocalyptic number.
It is an amenable number.
13354005053441 is a deficient number, since it is larger than the sum of its proper divisors (1652502297919).
13354005053441 is a wasteful number, since it uses less digits than its factorization.
13354005053441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 44662224295.
The product of its (nonzero) digits is 216000, while the sum is 38.
Adding to 13354005053441 its reverse (14435050045331), we get a palindrome (27789055098772).
The spelling of 13354005053441 in words is "thirteen trillion, three hundred fifty-four billion, five million, fifty-three thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •