Search a number
-
+
101100001100953 is a prime number
BaseRepresentation
bin10110111111001100101101…
…101001110000010010011001
3111020222001202220110020020111
4112333030231221300102121
5101222410300240212303
6555004411015524321
730203143163213461
oct2677145551602231
9436861686406214
10101100001100953
112a2392a6a4a348
12b409a359896a1
1344548c621836a
141ad73a24c4ba1
15ba4c9a3dbb6d
hex5bf32da70499

101100001100953 has 2 divisors, whose sum is σ = 101100001100954. Its totient is φ = 101100001100952.

The previous prime is 101100001100933. The next prime is 101100001101019. The reversal of 101100001100953 is 359001100001101.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 87453862712329 + 13646138388624 = 9351677^2 + 3694068^2 .

It is a cyclic number.

It is not a de Polignac number, because 101100001100953 - 25 = 101100001100921 is a prime.

It is a super-2 number, since 2×1011000011009532 (a number of 29 digits) contains 22 as substring.

It is not a weakly prime, because it can be changed into another prime (101100001100933) by changing a digit.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50550000550476 + 50550000550477.

It is an arithmetic number, because the mean of its divisors is an integer number (50550000550477).

Almost surely, 2101100001100953 is an apocalyptic number.

It is an amenable number.

101100001100953 is a deficient number, since it is larger than the sum of its proper divisors (1).

101100001100953 is an equidigital number, since it uses as much as digits as its factorization.

101100001100953 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 22.

The spelling of 101100001100953 in words is "one hundred one trillion, one hundred billion, one million, one hundred thousand, nine hundred fifty-three".