Base | Representation |
---|---|
bin | 1001001111011010110101… |
… | …01001001001001011001001 |
3 | 2122221200002012022112210111 |
4 | 10213231122221021023021 |
5 | 10130414412304343142 |
6 | 111115202114114321 |
7 | 4165100411426002 |
oct | 447553251111311 |
9 | 78850065275714 |
10 | 20321011012297 |
11 | 6525101a48906 |
12 | 234242157b9a1 |
13 | b453560b19a8 |
14 | 503783a5c1a9 |
15 | 2538e1e19e17 |
hex | 127b5aa492c9 |
20321011012297 has 2 divisors, whose sum is σ = 20321011012298. Its totient is φ = 20321011012296.
The previous prime is 20321011012279. The next prime is 20321011012333. The reversal of 20321011012297 is 79221011012302.
Together with previous prime (20321011012279) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 17192997845136 + 3128013167161 = 4146444^2 + 1768619^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20321011012297 is a prime.
It is not a weakly prime, because it can be changed into another prime (20321011012217) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10160505506148 + 10160505506149.
It is an arithmetic number, because the mean of its divisors is an integer number (10160505506149).
Almost surely, 220321011012297 is an apocalyptic number.
It is an amenable number.
20321011012297 is a deficient number, since it is larger than the sum of its proper divisors (1).
20321011012297 is an equidigital number, since it uses as much as digits as its factorization.
20321011012297 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3024, while the sum is 31.
Adding to 20321011012297 its reverse (79221011012302), we get a palindrome (99542022024599).
The spelling of 20321011012297 in words is "twenty trillion, three hundred twenty-one billion, eleven million, twelve thousand, two hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.103 sec. • engine limits •