Base | Representation |
---|---|
bin | 10111111001111001010011… |
… | …100111001111001011110011 |
3 | 111210020200020012111001000202 |
4 | 113321321103213033023303 |
5 | 102240002114220004402 |
6 | 1011333414213505415 |
7 | 31100436630342236 |
oct | 2771712347171363 |
9 | 453220205431022 |
10 | 105133612266227 |
11 | 30553a07329956 |
12 | b95b72204226b |
13 | 468809859806c |
14 | 1bd66cb6c741d |
15 | c24b7703ab02 |
hex | 5f9e539cf2f3 |
105133612266227 has 2 divisors, whose sum is σ = 105133612266228. Its totient is φ = 105133612266226.
The previous prime is 105133612266157. The next prime is 105133612266341. The reversal of 105133612266227 is 722662216331501.
It is a happy number.
It is a weak prime.
It is an emirp because it is prime and its reverse (722662216331501) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 105133612266227 - 214 = 105133612249843 is a prime.
It is a super-2 number, since 2×1051336122662272 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (105133612262227) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52566806133113 + 52566806133114.
It is an arithmetic number, because the mean of its divisors is an integer number (52566806133114).
Almost surely, 2105133612266227 is an apocalyptic number.
105133612266227 is a deficient number, since it is larger than the sum of its proper divisors (1).
105133612266227 is an equidigital number, since it uses as much as digits as its factorization.
105133612266227 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1088640, while the sum is 47.
Adding to 105133612266227 its reverse (722662216331501), we get a palindrome (827795828597728).
The spelling of 105133612266227 in words is "one hundred five trillion, one hundred thirty-three billion, six hundred twelve million, two hundred sixty-six thousand, two hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •