Base | Representation |
---|---|
bin | 10110110000110010110011… |
… | …000000111011100000111001 |
3 | 111010110102200001221221121111 |
4 | 112300302303000323200321 |
5 | 101110200441340204401 |
6 | 552525540123240321 |
7 | 30041500426100524 |
oct | 2660626300734071 |
9 | 433412601857544 |
10 | 100110101100601 |
11 | 2999750122a6a9 |
12 | b28a0123790a1 |
13 | 43b245a580597 |
14 | 1aa14d75d1bbb |
15 | b891606d7e51 |
hex | 5b0cb303b839 |
100110101100601 has 2 divisors, whose sum is σ = 100110101100602. Its totient is φ = 100110101100600.
The previous prime is 100110101100563. The next prime is 100110101100649. The reversal of 100110101100601 is 106001101011001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 88243102688400 + 11866998412201 = 9393780^2 + 3444851^2 .
It is a cyclic number.
It is not a de Polignac number, because 100110101100601 - 27 = 100110101100473 is a prime.
It is a super-2 number, since 2×1001101011006012 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (100110101130601) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50055050550300 + 50055050550301.
It is an arithmetic number, because the mean of its divisors is an integer number (50055050550301).
Almost surely, 2100110101100601 is an apocalyptic number.
It is an amenable number.
100110101100601 is a deficient number, since it is larger than the sum of its proper divisors (1).
100110101100601 is an equidigital number, since it uses as much as digits as its factorization.
100110101100601 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 6, while the sum is 13.
Adding to 100110101100601 its reverse (106001101011001), we get a palindrome (206111202111602).
The spelling of 100110101100601 in words is "one hundred trillion, one hundred ten billion, one hundred one million, one hundred thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •