Search a number
-
+
101101011001001 = 119191001000091
BaseRepresentation
bin10110111111001101101001…
…110110001101111010101001
3111020222011101021202110122222
4112333031221312031322221
5101222414332304013001
6555005055133323425
730203210205216464
oct2677155166157251
9436864337673588
10101101011001001
112a239775015190
12b40a078036575
134454a2751075b
141ad745a68c2db
15ba4d08dc661b
hex5bf369d8dea9

101101011001001 has 4 divisors (see below), whose sum is σ = 110292012001104. Its totient is φ = 91910010000900.

The previous prime is 101101011000961. The next prime is 101101011001073. The reversal of 101101011001001 is 100100110101101.

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 101101011001001 - 218 = 101101010738857 is a prime.

It is a Duffinian number.

It is a Curzon number.

It is a self number, because there is not a number n which added to its sum of digits gives 101101011001001.

It is not an unprimeable number, because it can be changed into a prime (101101011006001) 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, 4595500500035 + ... + 4595500500056.

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

Almost surely, 2101101011001001 is an apocalyptic number.

101101011001001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.

It is an amenable number.

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

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

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

The sum of its prime factors is 9191001000102.

The product of its (nonzero) digits is 1, while the sum is 8.

Adding to 101101011001001 its reverse (100100110101101), we get a palindrome (201201121102102).

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

Divisors: 1 11 9191001000091 101101011001001