Base | Representation |
---|---|
bin | 10110111101101111110010… |
… | …001111000110101001101001 |
3 | 111020121112012222201200021111 |
4 | 112331233302033012221221 |
5 | 101214241422310323423 |
6 | 554450505512510321 |
7 | 30163011415022143 |
oct | 2675576217065151 |
9 | 436545188650244 |
10 | 101000220011113 |
11 | 2a1aaa53142735 |
12 | b3b26293ab3a1 |
13 | 4448383b84277 |
14 | 1ad2618569c93 |
15 | ba23aa4e460d |
hex | 5bdbf23c6a69 |
101000220011113 has 2 divisors, whose sum is σ = 101000220011114. Its totient is φ = 101000220011112.
The previous prime is 101000220011107. The next prime is 101000220011177. The reversal of 101000220011113 is 311110022000101.
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., 100999344324649 + 875686464 = 10049843^2 + 29592^2 .
It is a cyclic number.
It is not a de Polignac number, because 101000220011113 - 25 = 101000220011081 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 101000220011093 and 101000220011102.
It is not a weakly prime, because it can be changed into another prime (101000220011413) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50500110005556 + 50500110005557.
It is an arithmetic number, because the mean of its divisors is an integer number (50500110005557).
Almost surely, 2101000220011113 is an apocalyptic number.
It is an amenable number.
101000220011113 is a deficient number, since it is larger than the sum of its proper divisors (1).
101000220011113 is an equidigital number, since it uses as much as digits as its factorization.
101000220011113 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 101000220011113 its reverse (311110022000101), we get a palindrome (412110242011214).
The spelling of 101000220011113 in words is "one hundred one trillion, two hundred twenty million, eleven thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •