Base | Representation |
---|---|
bin | 10110111111011111011100… |
… | …111101101111011001111001 |
3 | 111021000222201011220002121101 |
4 | 112333133130331233121321 |
5 | 101223223002242102301 |
6 | 555021535353211401 |
7 | 30204454616011525 |
oct | 2677373475573171 |
9 | 437028634802541 |
10 | 101120122222201 |
11 | 2a246891886575 |
12 | b411910400b61 |
13 | 4456781a20374 |
14 | 1ad83508d8d85 |
15 | ba5576ad0701 |
hex | 5bf7dcf6f679 |
101120122222201 has 2 divisors, whose sum is σ = 101120122222202. Its totient is φ = 101120122222200.
The previous prime is 101120122222199. The next prime is 101120122222253. The reversal of 101120122222201 is 102222221021101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 96961459303801 + 4158662918400 = 9846901^2 + 2039280^2 .
It is a cyclic number.
It is not a de Polignac number, because 101120122222201 - 21 = 101120122222199 is a prime.
Together with 101120122222199, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (101120122222001) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50560061111100 + 50560061111101.
It is an arithmetic number, because the mean of its divisors is an integer number (50560061111101).
Almost surely, 2101120122222201 is an apocalyptic number.
It is an amenable number.
101120122222201 is a deficient number, since it is larger than the sum of its proper divisors (1).
101120122222201 is an equidigital number, since it uses as much as digits as its factorization.
101120122222201 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 128, while the sum is 19.
Adding to 101120122222201 its reverse (102222221021101), we get a palindrome (203342343243302).
The spelling of 101120122222201 in words is "one hundred one trillion, one hundred twenty billion, one hundred twenty-two million, two hundred twenty-two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •