Base | Representation |
---|---|
bin | 1001000110101010001010… |
… | …0011011100101010001001 |
3 | 1022102221120011212202012102 |
4 | 2101222202203130222021 |
5 | 2303000440224013342 |
6 | 33142310405123145 |
7 | 2052125104426016 |
oct | 221524243345211 |
9 | 38387504782172 |
10 | 10010001001097 |
11 | 320a243672189 |
12 | 11580090b94b5 |
13 | 577c29106556 |
14 | 2686b547270d |
15 | 1255b2e4c832 |
hex | 91aa28dca89 |
10010001001097 has 2 divisors, whose sum is σ = 10010001001098. Its totient is φ = 10010001001096.
The previous prime is 10010001001093. The next prime is 10010001001111. The reversal of 10010001001097 is 79010010001001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9775508749561 + 234492251536 = 3126581^2 + 484244^2 .
It is an emirp because it is prime and its reverse (79010010001001) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10010001001097 - 22 = 10010001001093 is a prime.
It is not a weakly prime, because it can be changed into another prime (10010001001093) 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, 5005000500548 + 5005000500549.
It is an arithmetic number, because the mean of its divisors is an integer number (5005000500549).
Almost surely, 210010001001097 is an apocalyptic number.
It is an amenable number.
10010001001097 is a deficient number, since it is larger than the sum of its proper divisors (1).
10010001001097 is an equidigital number, since it uses as much as digits as its factorization.
10010001001097 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 63, while the sum is 20.
Adding to 10010001001097 its reverse (79010010001001), we get a palindrome (89020011002098).
The spelling of 10010001001097 in words is "ten trillion, ten billion, one million, one thousand, ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •