Base | Representation |
---|---|
bin | 10011000000000011… |
… | …10011011011000001 |
3 | 222022221000111212011 |
4 | 21200001303123001 |
5 | 131342430120342 |
6 | 4404123132521 |
7 | 510535145242 |
oct | 114001633301 |
9 | 28287014764 |
10 | 10201020097 |
11 | 4365234424 |
12 | 1b88374141 |
13 | c67540b88 |
14 | 6cab2ccc9 |
15 | 3ea869717 |
hex | 2600736c1 |
10201020097 has 2 divisors, whose sum is σ = 10201020098. Its totient is φ = 10201020096.
The previous prime is 10201020079. The next prime is 10201020103. The reversal of 10201020097 is 79002010201.
Together with previous prime (10201020079) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7322053761 + 2878966336 = 85569^2 + 53656^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10201020097 is a prime.
It is a super-2 number, since 2×102010200972 (a number of 21 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10201020197) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5100510048 + 5100510049.
It is an arithmetic number, because the mean of its divisors is an integer number (5100510049).
Almost surely, 210201020097 is an apocalyptic number.
It is an amenable number.
10201020097 is a deficient number, since it is larger than the sum of its proper divisors (1).
10201020097 is an equidigital number, since it uses as much as digits as its factorization.
10201020097 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 252, while the sum is 22.
Adding to 10201020097 its reverse (79002010201), we get a palindrome (89203030298).
The spelling of 10201020097 in words is "ten billion, two hundred one million, twenty thousand, ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •