Base | Representation |
---|---|
bin | 1100001001001001111001… |
… | …0010110101111000000001 |
3 | 1202021101100000010012210201 |
4 | 3002102132102311320001 |
5 | 3222222144002022421 |
6 | 44221315512125201 |
7 | 2545415326206556 |
oct | 302223622657001 |
9 | 52241300105721 |
10 | 13351414095361 |
11 | 42883372058a1 |
12 | 15b7715696801 |
13 | 75b0574cc154 |
14 | 3422d75d8a2d |
15 | 18247a916b91 |
hex | c249e4b5e01 |
13351414095361 has 4 divisors (see below), whose sum is σ = 14054120100400. Its totient is φ = 12648708090324.
The previous prime is 13351414095343. The next prime is 13351414095433. The reversal of 13351414095361 is 16359041415331.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 13351414095361 - 221 = 13351411998209 is a prime.
It is not an unprimeable number, because it can be changed into a prime (13351414093361) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 351353002491 + ... + 351353002528.
It is an arithmetic number, because the mean of its divisors is an integer number (3513530025100).
Almost surely, 213351414095361 is an apocalyptic number.
It is an amenable number.
13351414095361 is a deficient number, since it is larger than the sum of its proper divisors (702706005039).
13351414095361 is an equidigital number, since it uses as much as digits as its factorization.
13351414095361 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 702706005038.
The product of its (nonzero) digits is 583200, while the sum is 46.
The spelling of 13351414095361 in words is "thirteen trillion, three hundred fifty-one billion, four hundred fourteen million, ninety-five thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •