Base | Representation |
---|---|
bin | 10110111111001100101110… |
… | …001100000111110000000001 |
3 | 111020222001210112101221021011 |
4 | 112333030232030013300001 |
5 | 101222410310042004303 |
6 | 555004411541000521 |
7 | 30203143332615001 |
oct | 2677145614076001 |
9 | 436861715357234 |
10 | 101100010109953 |
11 | 2a2393010429a8 |
12 | b409a389b3141 |
13 | 44548c8050b2a |
14 | 1ad73a378c001 |
15 | ba4c9b0bb16d |
hex | 5bf32e307c01 |
101100010109953 has 2 divisors, whose sum is σ = 101100010109954. Its totient is φ = 101100010109952.
The previous prime is 101100010109947. The next prime is 101100010109993. The reversal of 101100010109953 is 359901010001101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 53422752773569 + 47677257336384 = 7309087^2 + 6904872^2 .
It is a cyclic number.
It is not a de Polignac number, because 101100010109953 - 25 = 101100010109921 is a prime.
It is a super-2 number, since 2×1011000101099532 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (101100010109933) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50550005054976 + 50550005054977.
It is an arithmetic number, because the mean of its divisors is an integer number (50550005054977).
Almost surely, 2101100010109953 is an apocalyptic number.
It is an amenable number.
101100010109953 is a deficient number, since it is larger than the sum of its proper divisors (1).
101100010109953 is an equidigital number, since it uses as much as digits as its factorization.
101100010109953 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1215, while the sum is 31.
The spelling of 101100010109953 in words is "one hundred one trillion, one hundred billion, ten million, one hundred nine thousand, nine hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •