Base | Representation |
---|---|
bin | 1011111100010010101000… |
… | …1110100001100001111111 |
3 | 1201111020220210021111102202 |
4 | 2333010222032201201333 |
5 | 3210112101402134203 |
6 | 43532011104142115 |
7 | 2523433064006612 |
oct | 277045216414177 |
9 | 51436823244382 |
10 | 13130423474303 |
11 | 4202643818393 |
12 | 158092030793b |
13 | 743269500155 |
14 | 335731846179 |
15 | 17b844799388 |
hex | bf12a3a187f |
13130423474303 has 2 divisors, whose sum is σ = 13130423474304. Its totient is φ = 13130423474302.
The previous prime is 13130423474299. The next prime is 13130423474317. The reversal of 13130423474303 is 30347432403131.
It is a weak prime.
It is an emirp because it is prime and its reverse (30347432403131) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 13130423474303 - 22 = 13130423474299 is a prime.
It is a super-2 number, since 2×131304234743032 (a number of 27 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13130423474323) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6565211737151 + 6565211737152.
It is an arithmetic number, because the mean of its divisors is an integer number (6565211737152).
Almost surely, 213130423474303 is an apocalyptic number.
13130423474303 is a deficient number, since it is larger than the sum of its proper divisors (1).
13130423474303 is an equidigital number, since it uses as much as digits as its factorization.
13130423474303 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 217728, while the sum is 38.
Adding to 13130423474303 its reverse (30347432403131), we get a palindrome (43477855877434).
The spelling of 13130423474303 in words is "thirteen trillion, one hundred thirty billion, four hundred twenty-three million, four hundred seventy-four thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •