Base | Representation |
---|---|
bin | 11101000110101001011… |
… | …01011101110100101001 |
3 | 10112121011210111100220102 |
4 | 32203110231131310221 |
5 | 112341000240213342 |
6 | 2043221050035145 |
7 | 132150650053145 |
oct | 16432455356451 |
9 | 3477153440812 |
10 | 1000001101097 |
11 | 356109608199 |
12 | 141982418ab5 |
13 | 733b8592a8b |
14 | 36586652225 |
15 | 1b02b8d2832 |
hex | e8d4b5dd29 |
1000001101097 has 2 divisors, whose sum is σ = 1000001101098. Its totient is φ = 1000001101096.
The previous prime is 1000001101093. The next prime is 1000001101117. The reversal of 1000001101097 is 7901011000001.
It is an a-pointer prime, because the next prime (1000001101117) can be obtained adding 1000001101097 to its sum of digits (20).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 949330640896 + 50670460201 = 974336^2 + 225101^2 .
It is a cyclic number.
It is not a de Polignac number, because 1000001101097 - 22 = 1000001101093 is a prime.
It is not a weakly prime, because it can be changed into another prime (1000001101093) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 500000550548 + 500000550549.
It is an arithmetic number, because the mean of its divisors is an integer number (500000550549).
Almost surely, 21000001101097 is an apocalyptic number.
It is an amenable number.
1000001101097 is a deficient number, since it is larger than the sum of its proper divisors (1).
1000001101097 is an equidigital number, since it uses as much as digits as its factorization.
1000001101097 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 63, while the sum is 20.
Adding to 1000001101097 its reverse (7901011000001), we get a palindrome (8901012101098).
The spelling of 1000001101097 in words is "one trillion, one million, one hundred one thousand, ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •