Base | Representation |
---|---|
bin | 1100001100000010101010… |
… | …0110001110001010101101 |
3 | 1202110010100121111122010102 |
4 | 3003000222212032022231 |
5 | 3224030233213013333 |
6 | 44300201252520445 |
7 | 2552122404601151 |
oct | 303005246161255 |
9 | 52403317448112 |
10 | 13401012626093 |
11 | 42a737929a064 |
12 | 1605258020125 |
13 | 7629300348a1 |
14 | 3448808a1061 |
15 | 1838cee07ae8 |
hex | c302a98e2ad |
13401012626093 has 2 divisors, whose sum is σ = 13401012626094. Its totient is φ = 13401012626092.
The previous prime is 13401012626041. The next prime is 13401012626123. The reversal of 13401012626093 is 39062621010431.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10906625140324 + 2494387485769 = 3302518^2 + 1579363^2 .
It is an emirp because it is prime and its reverse (39062621010431) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 13401012626093 - 226 = 13400945517229 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13401012622093) 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 as a sum of consecutive naturals, namely, 6700506313046 + 6700506313047.
It is an arithmetic number, because the mean of its divisors is an integer number (6700506313047).
Almost surely, 213401012626093 is an apocalyptic number.
It is an amenable number.
13401012626093 is a deficient number, since it is larger than the sum of its proper divisors (1).
13401012626093 is an equidigital number, since it uses as much as digits as its factorization.
13401012626093 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 46656, while the sum is 38.
The spelling of 13401012626093 in words is "thirteen trillion, four hundred one billion, twelve million, six hundred twenty-six thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •