Base | Representation |
---|---|
bin | 10110111111001101101001… |
… | …010011111000101010111001 |
3 | 111020222011100122211020002121 |
4 | 112333031221103320222321 |
5 | 101222414323003013311 |
6 | 555005054212401241 |
7 | 30203210035553605 |
oct | 2677155123705271 |
9 | 436864318736077 |
10 | 101101002001081 |
11 | 2a23976aa28435 |
12 | b40a075016221 |
13 | 4454a256ac164 |
14 | 1ad74593c8505 |
15 | ba4d081e9b71 |
hex | 5bf3694f8ab9 |
101101002001081 has 2 divisors, whose sum is σ = 101101002001082. Its totient is φ = 101101002001080.
The previous prime is 101101002000923. The next prime is 101101002001099. The reversal of 101101002001081 is 180100200101101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 70592612567481 + 30508389433600 = 8401941^2 + 5523440^2 .
It is a cyclic number.
It is not a de Polignac number, because 101101002001081 - 213 = 101101001992889 is a prime.
It is a super-2 number, since 2×1011010020010812 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (101101002007081) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50550501000540 + 50550501000541.
It is an arithmetic number, because the mean of its divisors is an integer number (50550501000541).
Almost surely, 2101101002001081 is an apocalyptic number.
It is an amenable number.
101101002001081 is a deficient number, since it is larger than the sum of its proper divisors (1).
101101002001081 is an equidigital number, since it uses as much as digits as its factorization.
101101002001081 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 16, while the sum is 16.
Adding to 101101002001081 its reverse (180100200101101), we get a palindrome (281201202102182).
The spelling of 101101002001081 in words is "one hundred one trillion, one hundred one billion, two million, one thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •