Base | Representation |
---|---|
bin | 1011100101000010000001… |
… | …1001000101101000110101 |
3 | 1200002001111012002121112012 |
4 | 2321100200121011220311 |
5 | 3132040213041403244 |
6 | 43024243322334005 |
7 | 2452525514614436 |
oct | 271204031055065 |
9 | 50061435077465 |
10 | 12730826512949 |
11 | 4069127746986 |
12 | 15173a005a305 |
13 | 71468652851c |
14 | 320264dd948d |
15 | 17125846489e |
hex | b9420645a35 |
12730826512949 has 2 divisors, whose sum is σ = 12730826512950. Its totient is φ = 12730826512948.
The previous prime is 12730826512909. The next prime is 12730826513071. The reversal of 12730826512949 is 94921562803721.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 12703628566225 + 27197946724 = 3564215^2 + 164918^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12730826512949 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12730826512909) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6365413256474 + 6365413256475.
It is an arithmetic number, because the mean of its divisors is an integer number (6365413256475).
It is a 1-persistent number, because it is pandigital, but 2⋅12730826512949 = 25461653025898 is not.
Almost surely, 212730826512949 is an apocalyptic number.
It is an amenable number.
12730826512949 is a deficient number, since it is larger than the sum of its proper divisors (1).
12730826512949 is an equidigital number, since it uses as much as digits as its factorization.
12730826512949 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 13063680, while the sum is 59.
The spelling of 12730826512949 in words is "twelve trillion, seven hundred thirty billion, eight hundred twenty-six million, five hundred twelve thousand, nine hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •