Base | Representation |
---|---|
bin | 1011110101110111010110… |
… | …1011001100011000011101 |
3 | 1201002200221120220120120001 |
4 | 2331131311223030120131 |
5 | 3201310000123200412 |
6 | 43405151545254301 |
7 | 2512444144042321 |
oct | 275356553143035 |
9 | 51080846816501 |
10 | 13020020131357 |
11 | 416a839a297a8 |
12 | 156344a494391 |
13 | 735a235911a5 |
14 | 33025ac6b981 |
15 | 178a3207c957 |
hex | bd775acc61d |
13020020131357 has 2 divisors, whose sum is σ = 13020020131358. Its totient is φ = 13020020131356.
The previous prime is 13020020131319. The next prime is 13020020131361. The reversal of 13020020131357 is 75313102002031.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8406369591876 + 4613650539481 = 2899374^2 + 2147941^2 .
It is a cyclic number.
It is not a de Polignac number, because 13020020131357 - 211 = 13020020129309 is a prime.
It is a super-2 number, since 2×130200201313572 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13020020101357) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6510010065678 + 6510010065679.
It is an arithmetic number, because the mean of its divisors is an integer number (6510010065679).
Almost surely, 213020020131357 is an apocalyptic number.
It is an amenable number.
13020020131357 is a deficient number, since it is larger than the sum of its proper divisors (1).
13020020131357 is an equidigital number, since it uses as much as digits as its factorization.
13020020131357 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3780, while the sum is 28.
Adding to 13020020131357 its reverse (75313102002031), we get a palindrome (88333122133388).
The spelling of 13020020131357 in words is "thirteen trillion, twenty billion, twenty million, one hundred thirty-one thousand, three hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •