Base | Representation |
---|---|
bin | 1011111100010110101110… |
… | …0111011001100101011001 |
3 | 1201111100202020112220112012 |
4 | 2333011223213121211121 |
5 | 3210121323222430033 |
6 | 43532312013355305 |
7 | 2523502214464331 |
oct | 277055347314531 |
9 | 51440666486465 |
10 | 13131520514393 |
11 | 4203056aa0896 |
12 | 1580b87798b35 |
13 | 7433b28857b8 |
14 | 3357d74140c1 |
15 | 17b8aac48248 |
hex | bf16b9d9959 |
13131520514393 has 4 divisors (see below), whose sum is σ = 13259011004928. Its totient is φ = 13004030023860.
The previous prime is 13131520514363. The next prime is 13131520514471. The reversal of 13131520514393 is 39341502513131.
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 13131520514393 - 28 = 13131520514137 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 13131520514393.
It is not an unprimeable number, because it can be changed into a prime (13131520514353) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 63745245113 + ... + 63745245318.
It is an arithmetic number, because the mean of its divisors is an integer number (3314752751232).
Almost surely, 213131520514393 is an apocalyptic number.
It is an amenable number.
13131520514393 is a deficient number, since it is larger than the sum of its proper divisors (127490490535).
13131520514393 is a wasteful number, since it uses less digits than its factorization.
13131520514393 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 127490490534.
The product of its (nonzero) digits is 145800, while the sum is 41.
The spelling of 13131520514393 in words is "thirteen trillion, one hundred thirty-one billion, five hundred twenty million, five hundred fourteen thousand, three hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •