Base | Representation |
---|---|
bin | 110000111111101000… |
… | …0100001100000101101 |
3 | 101001120120011211210221 |
4 | 1201333100201200231 |
5 | 3210434322044401 |
6 | 120200150331341 |
7 | 10413210252406 |
oct | 1417720414055 |
9 | 331516154727 |
10 | 105214253101 |
11 | 40691780691 |
12 | 18484059b51 |
13 | 9bc9b75cc9 |
14 | 51417749ad |
15 | 2b0bdb37a1 |
hex | 187f42182d |
105214253101 has 2 divisors, whose sum is σ = 105214253102. Its totient is φ = 105214253100.
The previous prime is 105214253069. The next prime is 105214253153. The reversal of 105214253101 is 101352412501.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 104263764201 + 950488900 = 322899^2 + 30830^2 .
It is a cyclic number.
It is not a de Polignac number, because 105214253101 - 25 = 105214253069 is a prime.
It is a super-2 number, since 2×1052142531012 (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 (105214253201) 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, 52607126550 + 52607126551.
It is an arithmetic number, because the mean of its divisors is an integer number (52607126551).
Almost surely, 2105214253101 is an apocalyptic number.
It is an amenable number.
105214253101 is a deficient number, since it is larger than the sum of its proper divisors (1).
105214253101 is an equidigital number, since it uses as much as digits as its factorization.
105214253101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1200, while the sum is 25.
Adding to 105214253101 its reverse (101352412501), we get a palindrome (206566665602).
The spelling of 105214253101 in words is "one hundred five billion, two hundred fourteen million, two hundred fifty-three thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •