Base | Representation |
---|---|
bin | 11000000111111101011010… |
… | …110001110001101011111001 |
3 | 111220200001220101212121001001 |
4 | 120013331122301301223321 |
5 | 102401321001112023342 |
6 | 1013353414010325001 |
7 | 31230323250436141 |
oct | 3007753261615371 |
9 | 456601811777031 |
10 | 106100100111097 |
11 | 30896888541674 |
12 | ba96ab0a29761 |
13 | 47282729676c1 |
14 | 1c2b3b5081921 |
15 | c3ed916698b7 |
hex | 607f5ac71af9 |
106100100111097 has 2 divisors, whose sum is σ = 106100100111098. Its totient is φ = 106100100111096.
The previous prime is 106100100111059. The next prime is 106100100111113. The reversal of 106100100111097 is 790111001001601.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 64695817043641 + 41404283067456 = 8043371^2 + 6434616^2 .
It is a cyclic number.
It is not a de Polignac number, because 106100100111097 - 235 = 106065740372729 is a prime.
It is a super-2 number, since 2×1061001001110972 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (106100100111017) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 53050050055548 + 53050050055549.
It is an arithmetic number, because the mean of its divisors is an integer number (53050050055549).
Almost surely, 2106100100111097 is an apocalyptic number.
It is an amenable number.
106100100111097 is a deficient number, since it is larger than the sum of its proper divisors (1).
106100100111097 is an equidigital number, since it uses as much as digits as its factorization.
106100100111097 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 378, while the sum is 28.
Adding to 106100100111097 its reverse (790111001001601), we get a palindrome (896211101112698).
The spelling of 106100100111097 in words is "one hundred six trillion, one hundred billion, one hundred million, one hundred eleven thousand, ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •