Base | Representation |
---|---|
bin | 10110111111001100110100… |
… | …001001100011100111100001 |
3 | 111020222002001111120000010211 |
4 | 112333030310021203213201 |
5 | 101222411011141212321 |
6 | 555004425512054121 |
7 | 30203145655541656 |
oct | 2677146411434741 |
9 | 436862044500124 |
10 | 101100110100961 |
11 | 2a2393525286a4 |
12 | b409a66394341 |
13 | 44549129904ca |
14 | 1ad73b2b79c2d |
15 | ba4ca4c6d0e1 |
hex | 5bf3342639e1 |
101100110100961 has 2 divisors, whose sum is σ = 101100110100962. Its totient is φ = 101100110100960.
The previous prime is 101100110100959. The next prime is 101100110101009. The reversal of 101100110100961 is 169001011001101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 74997002926561 + 26103107174400 = 8660081^2 + 5109120^2 .
It is a cyclic number.
It is not a de Polignac number, because 101100110100961 - 21 = 101100110100959 is a prime.
It is a super-2 number, since 2×1011001101009612 (a number of 29 digits) contains 22 as substring.
Together with 101100110100959, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (101100110100931) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50550055050480 + 50550055050481.
It is an arithmetic number, because the mean of its divisors is an integer number (50550055050481).
Almost surely, 2101100110100961 is an apocalyptic number.
It is an amenable number.
101100110100961 is a deficient number, since it is larger than the sum of its proper divisors (1).
101100110100961 is an equidigital number, since it uses as much as digits as its factorization.
101100110100961 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 54, while the sum is 22.
The spelling of 101100110100961 in words is "one hundred one trillion, one hundred billion, one hundred ten million, one hundred thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •