Base | Representation |
---|---|
bin | 1001010001110001110001… |
… | …0000000111000100010001 |
3 | 1100010012121201022000210012 |
4 | 2110130130100013010101 |
5 | 2314113142424011142 |
6 | 33410141241244305 |
7 | 2101666550331143 |
oct | 224343420070421 |
9 | 40105551260705 |
10 | 10201021313297 |
11 | 3283257655aa1 |
12 | 1189039493695 |
13 | 58cc4bc37999 |
14 | 273a36b08c93 |
15 | 12a542da8882 |
hex | 9471c407111 |
10201021313297 has 2 divisors, whose sum is σ = 10201021313298. Its totient is φ = 10201021313296.
The previous prime is 10201021313279. The next prime is 10201021313333. The reversal of 10201021313297 is 79231312010201.
Together with previous prime (10201021313279) 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., 10192956554881 + 8064758416 = 3192641^2 + 89804^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10201021313297 is a prime.
It is not a weakly prime, because it can be changed into another prime (10201021313237) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5100510656648 + 5100510656649.
It is an arithmetic number, because the mean of its divisors is an integer number (5100510656649).
Almost surely, 210201021313297 is an apocalyptic number.
It is an amenable number.
10201021313297 is a deficient number, since it is larger than the sum of its proper divisors (1).
10201021313297 is an equidigital number, since it uses as much as digits as its factorization.
10201021313297 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4536, while the sum is 32.
Adding to 10201021313297 its reverse (79231312010201), we get a palindrome (89432333323498).
The spelling of 10201021313297 in words is "ten trillion, two hundred one billion, twenty-one million, three hundred thirteen thousand, two hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •