Base | Representation |
---|---|
bin | 1001001000111000000100… |
… | …10100101010011110110001 |
3 | 2122011011210002201000122111 |
4 | 10210130002110222132301 |
5 | 10113223444340334142 |
6 | 110424021312005321 |
7 | 4142621226424201 |
oct | 444340224523661 |
9 | 78134702630574 |
10 | 20096190949297 |
11 | 644882397aa51 |
12 | 2306939830841 |
13 | b2a0a790a608 |
14 | 4d6937472401 |
15 | 24cb349b7e17 |
hex | 12470252a7b1 |
20096190949297 has 2 divisors, whose sum is σ = 20096190949298. Its totient is φ = 20096190949296.
The previous prime is 20096190949231. The next prime is 20096190949333. The reversal of 20096190949297 is 79294909169002.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 14173387739536 + 5922803209761 = 3764756^2 + 2433681^2 .
It is a cyclic number.
It is not a de Polignac number, because 20096190949297 - 231 = 20094043465649 is a prime.
It is a super-3 number, since 3×200961909492973 (a number of 41 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (20096190989297) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10048095474648 + 10048095474649.
It is an arithmetic number, because the mean of its divisors is an integer number (10048095474649).
Almost surely, 220096190949297 is an apocalyptic number.
It is an amenable number.
20096190949297 is a deficient number, since it is larger than the sum of its proper divisors (1).
20096190949297 is an equidigital number, since it uses as much as digits as its factorization.
20096190949297 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 39680928, while the sum is 67.
The spelling of 20096190949297 in words is "twenty trillion, ninety-six billion, one hundred ninety million, nine hundred forty-nine thousand, two hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.039 sec. • engine limits •