Base | Representation |
---|---|
bin | 110000111111101000… |
… | …0100001100010001101 |
3 | 101001120120011211221111 |
4 | 1201333100201202031 |
5 | 3210434322100242 |
6 | 120200150332021 |
7 | 10413210252604 |
oct | 1417720414215 |
9 | 331516154844 |
10 | 105214253197 |
11 | 40691780769 |
12 | 1848405a011 |
13 | 9bc9b76071 |
14 | 5141774a3b |
15 | 2b0bdb3817 |
hex | 187f42188d |
105214253197 has 2 divisors, whose sum is σ = 105214253198. Its totient is φ = 105214253196.
The previous prime is 105214253153. The next prime is 105214253201. The reversal of 105214253197 is 791352412501.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 73455092676 + 31759160521 = 271026^2 + 178211^2 .
It is a cyclic number.
It is not a de Polignac number, because 105214253197 - 27 = 105214253069 is a prime.
It is a super-2 number, since 2×1052142531972 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (105214253297) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52607126598 + 52607126599.
It is an arithmetic number, because the mean of its divisors is an integer number (52607126599).
Almost surely, 2105214253197 is an apocalyptic number.
It is an amenable number.
105214253197 is a deficient number, since it is larger than the sum of its proper divisors (1).
105214253197 is an equidigital number, since it uses as much as digits as its factorization.
105214253197 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 75600, while the sum is 40.
Adding to 105214253197 its reverse (791352412501), we get a palindrome (896566665698).
The spelling of 105214253197 in words is "one hundred five billion, two hundred fourteen million, two hundred fifty-three thousand, one hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •