Base | Representation |
---|---|
bin | 1001001110000000110011… |
… | …1110000110011010011101 |
3 | 1022220000122222210102112122 |
4 | 2103200030332012122131 |
5 | 2312033211122034344 |
6 | 33320323121312325 |
7 | 2064216652002656 |
oct | 223401476063235 |
9 | 38800588712478 |
10 | 10136340424349 |
11 | 3258885a08877 |
12 | 11785a7a956a5 |
13 | 586b117ab629 |
14 | 27085c70052d |
15 | 128a09735aee |
hex | 9380cf8669d |
10136340424349 has 2 divisors, whose sum is σ = 10136340424350. Its totient is φ = 10136340424348.
The previous prime is 10136340424229. The next prime is 10136340424351. The reversal of 10136340424349 is 94342404363101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8168792772100 + 1967547652249 = 2858110^2 + 1402693^2 .
It is an emirp because it is prime and its reverse (94342404363101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10136340424349 - 224 = 10136323647133 is a prime.
Together with 10136340424351, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10136340424369) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5068170212174 + 5068170212175.
It is an arithmetic number, because the mean of its divisors is an integer number (5068170212175).
Almost surely, 210136340424349 is an apocalyptic number.
It is an amenable number.
10136340424349 is a deficient number, since it is larger than the sum of its proper divisors (1).
10136340424349 is an equidigital number, since it uses as much as digits as its factorization.
10136340424349 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 746496, while the sum is 44.
The spelling of 10136340424349 in words is "ten trillion, one hundred thirty-six billion, three hundred forty million, four hundred twenty-four thousand, three hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •