Search a number
-
+
1101535189401 = 3541967757593
BaseRepresentation
bin10000000001111000100…
…111010001100110011001
310220022020212210110200110
4100001320213101212121
5121021421002030101
62202012133554533
7142404032423253
oct20017047214631
93808225713613
101101535189401
11395181996569
12159599aa5a49
137cb49b6b57a
143b45932acd3
151d9c064bcd6
hex100789d1999

1101535189401 has 8 divisors (see below), whose sum is σ = 1468984637920. Its totient is φ = 734221266912.

The previous prime is 1101535189397. The next prime is 1101535189411. The reversal of 1101535189401 is 1049815351011.

It is a sphenic number, since it is the product of 3 distinct primes.

It is not a de Polignac number, because 1101535189401 - 22 = 1101535189397 is a prime.

It is a Duffinian number.

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

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

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 33862540 + ... + 33895053.

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

Almost surely, 21101535189401 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 67763015.

The product of its (nonzero) digits is 21600, while the sum is 39.

The spelling of 1101535189401 in words is "one trillion, one hundred one billion, five hundred thirty-five million, one hundred eighty-nine thousand, four hundred one".

Divisors: 1 3 5419 16257 67757593 203272779 367178396467 1101535189401