Base | Representation |
---|---|
bin | 10110111111001100110100… |
… | …001101011010001100101001 |
3 | 111020222002001120110022120221 |
4 | 112333030310031122030221 |
5 | 101222411011421022303 |
6 | 555004425545450041 |
7 | 30203146000246363 |
oct | 2677146415321451 |
9 | 436862046408527 |
10 | 101100111110953 |
11 | 2a2393530584a9 |
12 | b409a667a0921 |
13 | 4454912c55136 |
14 | 1ad73b2d5dd33 |
15 | ba4ca4dbc4bd |
hex | 5bf33435a329 |
101100111110953 has 2 divisors, whose sum is σ = 101100111110954. Its totient is φ = 101100111110952.
The previous prime is 101100111110923. The next prime is 101100111111011. The reversal of 101100111110953 is 359011111001101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 78507609644304 + 22592501466649 = 8860452^2 + 4753157^2 .
It is a cyclic number.
It is not a de Polignac number, because 101100111110953 - 221 = 101100109013801 is a prime.
It is not a weakly prime, because it can be changed into another prime (101100111110923) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50550055555476 + 50550055555477.
It is an arithmetic number, because the mean of its divisors is an integer number (50550055555477).
Almost surely, 2101100111110953 is an apocalyptic number.
It is an amenable number.
101100111110953 is a deficient number, since it is larger than the sum of its proper divisors (1).
101100111110953 is an equidigital number, since it uses as much as digits as its factorization.
101100111110953 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 135, while the sum is 25.
The spelling of 101100111110953 in words is "one hundred one trillion, one hundred billion, one hundred eleven million, one hundred ten thousand, nine hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •