Base | Representation |
---|---|
bin | 10110110000110010110011… |
… | …100011010000110011011101 |
3 | 111010110102200200220012102112 |
4 | 112300302303203100303131 |
5 | 101110201001141210301 |
6 | 552525541044203405 |
7 | 30041500565434061 |
oct | 2660626343206335 |
9 | 433412620805375 |
10 | 100110110100701 |
11 | 299975063175a8 |
12 | b28a015399565 |
13 | 43b245c3b1c9c |
14 | 1aa14d8895aa1 |
15 | b891613b49bb |
hex | 5b0cb38d0cdd |
100110110100701 has 2 divisors, whose sum is σ = 100110110100702. Its totient is φ = 100110110100700.
The previous prime is 100110110100659. The next prime is 100110110100703. The reversal of 100110110100701 is 107001011011001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 94824943596100 + 5285166504601 = 9737810^2 + 2298949^2 .
It is a cyclic number.
It is not a de Polignac number, because 100110110100701 - 234 = 100092930231517 is a prime.
Together with 100110110100703, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (100110110100703) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50055055050350 + 50055055050351.
It is an arithmetic number, because the mean of its divisors is an integer number (50055055050351).
Almost surely, 2100110110100701 is an apocalyptic number.
It is an amenable number.
100110110100701 is a deficient number, since it is larger than the sum of its proper divisors (1).
100110110100701 is an equidigital number, since it uses as much as digits as its factorization.
100110110100701 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 7, while the sum is 14.
Adding to 100110110100701 its reverse (107001011011001), we get a palindrome (207111121111702).
The spelling of 100110110100701 in words is "one hundred trillion, one hundred ten billion, one hundred ten million, one hundred thousand, seven hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •