Base | Representation |
---|---|
bin | 10010110100010000… |
… | …00111010011011001 |
3 | 222002000201100001011 |
4 | 21122020013103121 |
5 | 131142103323342 |
6 | 4350225053521 |
7 | 505223451253 |
oct | 113210072331 |
9 | 28060640034 |
10 | 10102011097 |
11 | 431435a502 |
12 | 1b5b1872a1 |
13 | c4cb86479 |
14 | 6bb918cd3 |
15 | 3e1d0d717 |
hex | 25a2074d9 |
10102011097 has 2 divisors, whose sum is σ = 10102011098. Its totient is φ = 10102011096.
The previous prime is 10102011083. The next prime is 10102011169. The reversal of 10102011097 is 79011020101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9757685961 + 344325136 = 98781^2 + 18556^2 .
It is a cyclic number.
It is not a de Polignac number, because 10102011097 - 27 = 10102010969 is a prime.
It is a super-2 number, since 2×101020110972 (a number of 21 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10102011037) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5051005548 + 5051005549.
It is an arithmetic number, because the mean of its divisors is an integer number (5051005549).
Almost surely, 210102011097 is an apocalyptic number.
It is an amenable number.
10102011097 is a deficient number, since it is larger than the sum of its proper divisors (1).
10102011097 is an equidigital number, since it uses as much as digits as its factorization.
10102011097 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 126, while the sum is 22.
Adding to 10102011097 its reverse (79011020101), we get a palindrome (89113031198).
The spelling of 10102011097 in words is "ten billion, one hundred two million, eleven thousand, ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •