Base | Representation |
---|---|
bin | 10111000000111110100001… |
… | …010110001011110011111101 |
3 | 111021101202012020112001221002 |
4 | 113000332201112023303331 |
5 | 101231411032002242112 |
6 | 555140500504220045 |
7 | 30215030336060324 |
oct | 2700764126136375 |
9 | 437352166461832 |
10 | 101222201212157 |
11 | 2a2861047aa593 |
12 | b42965a46a625 |
13 | 446329c17287c |
14 | 1add275ad70bb |
15 | ba804d5d21c2 |
hex | 5c0fa158bcfd |
101222201212157 has 2 divisors, whose sum is σ = 101222201212158. Its totient is φ = 101222201212156.
The previous prime is 101222201212129. The next prime is 101222201212229. The reversal of 101222201212157 is 751212102222101.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 100932182343001 + 290018869156 = 10046501^2 + 538534^2 .
It is a cyclic number.
It is not a de Polignac number, because 101222201212157 - 222 = 101222197017853 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101222201212117) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50611100606078 + 50611100606079.
It is an arithmetic number, because the mean of its divisors is an integer number (50611100606079).
Almost surely, 2101222201212157 is an apocalyptic number.
It is an amenable number.
101222201212157 is a deficient number, since it is larger than the sum of its proper divisors (1).
101222201212157 is an equidigital number, since it uses as much as digits as its factorization.
101222201212157 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2240, while the sum is 29.
Adding to 101222201212157 its reverse (751212102222101), we get a palindrome (852434303434258).
The spelling of 101222201212157 in words is "one hundred one trillion, two hundred twenty-two billion, two hundred one million, two hundred twelve thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •