Base | Representation |
---|---|
bin | 1011110100001010000101… |
… | …0100100101001111011101 |
3 | 1200222220020100122010121001 |
4 | 2331002201110211033131 |
5 | 3200314412013132201 |
6 | 43343501200110301 |
7 | 2510355230641453 |
oct | 275024124451735 |
9 | 50886210563531 |
10 | 12990687630301 |
11 | 4159357556597 |
12 | 1559823005391 |
13 | 73302a598ca4 |
14 | 32ca7733a9d3 |
15 | 177db6d56301 |
hex | bd0a15253dd |
12990687630301 has 2 divisors, whose sum is σ = 12990687630302. Its totient is φ = 12990687630300.
The previous prime is 12990687630299. The next prime is 12990687630439. The reversal of 12990687630301 is 10303678609921.
12990687630301 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 12374107759225 + 616579871076 = 3517685^2 + 785226^2 .
It is a cyclic number.
It is not a de Polignac number, because 12990687630301 - 21 = 12990687630299 is a prime.
Together with 12990687630299, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12990687630901) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6495343815150 + 6495343815151.
It is an arithmetic number, because the mean of its divisors is an integer number (6495343815151).
Almost surely, 212990687630301 is an apocalyptic number.
It is an amenable number.
12990687630301 is a deficient number, since it is larger than the sum of its proper divisors (1).
12990687630301 is an equidigital number, since it uses as much as digits as its factorization.
12990687630301 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2939328, while the sum is 55.
The spelling of 12990687630301 in words is "twelve trillion, nine hundred ninety billion, six hundred eighty-seven million, six hundred thirty thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •