Base | Representation |
---|---|
bin | 1011111010100001100011… |
… | …1101000101000101100001 |
3 | 1201101100120022211020200221 |
4 | 2332220120331011011201 |
5 | 3204112420120330401 |
6 | 43510031044443041 |
7 | 2521306630355011 |
oct | 276503075050541 |
9 | 51340508736627 |
10 | 13100068917601 |
11 | 41a0787427696 |
12 | 1576a6a6a9481 |
13 | 74043c847ab3 |
14 | 3340922a5c41 |
15 | 17ab699867a1 |
hex | bea18f45161 |
13100068917601 has 2 divisors, whose sum is σ = 13100068917602. Its totient is φ = 13100068917600.
The previous prime is 13100068917587. The next prime is 13100068917623. The reversal of 13100068917601 is 10671986000131.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11985617100625 + 1114451816976 = 3462025^2 + 1055676^2 .
It is a cyclic number.
It is not a de Polignac number, because 13100068917601 - 27 = 13100068917473 is a prime.
It is a super-2 number, since 2×131000689176012 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (13100068917701) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6550034458800 + 6550034458801.
It is an arithmetic number, because the mean of its divisors is an integer number (6550034458801).
Almost surely, 213100068917601 is an apocalyptic number.
It is an amenable number.
13100068917601 is a deficient number, since it is larger than the sum of its proper divisors (1).
13100068917601 is an equidigital number, since it uses as much as digits as its factorization.
13100068917601 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 54432, while the sum is 43.
The spelling of 13100068917601 in words is "thirteen trillion, one hundred billion, sixty-eight million, nine hundred seventeen thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •