Search a number
-
+
101105060511001 = 313261453564871
BaseRepresentation
bin10110111111010001011011…
…001101110111110100011001
3111020222112211111121220001211
4112333101123031313310121
5101223001130442323001
6555011005032343121
730203412436410211
oct2677213315676431
9436875744556054
10101105060511001
112a240462944a68
12b40aa08244aa1
134455221478511
141ad772240d241
15ba4e9467b351
hex5bf45b377d19

101105060511001 has 4 divisors (see below), whose sum is σ = 104366514075904. Its totient is φ = 97843606946100.

The previous prime is 101105060510983. The next prime is 101105060511011. The reversal of 101105060511001 is 100115060501101.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is a cyclic number.

It is not a de Polignac number, because 101105060511001 - 25 = 101105060510969 is a prime.

It is not an unprimeable number, because it can be changed into a prime (101105060511011) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (29) of ones.

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1630726782405 + ... + 1630726782466.

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

Almost surely, 2101105060511001 is an apocalyptic number.

It is an amenable number.

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

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

101105060511001 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 3261453564902.

The product of its (nonzero) digits is 150, while the sum is 22.

The spelling of 101105060511001 in words is "one hundred one trillion, one hundred five billion, sixty million, five hundred eleven thousand, one".

Divisors: 1 31 3261453564871 101105060511001