Search a number
-
+
1101120002001 = 32432845271323
BaseRepresentation
bin10000000001011111110…
…111011101011111010001
310220021011221112202122100
4100001133313131133101
5121020043210031001
62201503023031013
7142360531405335
oct20013767353721
93807157482570
101101120002001
11394a89598088
121594a2a3b469
137cab1b40256
143b41a1317c5
151d998e88586
hex1005fddd7d1

1101120002001 has 12 divisors (see below), whose sum is σ = 1627495197328. Its totient is φ = 717008373144.

The previous prime is 1101120001997. The next prime is 1101120002053. The reversal of 1101120002001 is 1002000211011.

It is a happy number.

It is not a de Polignac number, because 1101120002001 - 22 = 1101120001997 is a prime.

It is a Harshad number since it is a multiple of its sum of digits (9).

It is a Duffinian number.

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

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

It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1422635275 + ... + 1422636048.

Almost surely, 21101120002001 is an apocalyptic number.

It is an amenable number.

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

1101120002001 is a wasteful number, since it uses less digits than its factorization.

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

The sum of its prime factors is 2845271372 (or 2845271369 counting only the distinct ones).

The product of its (nonzero) digits is 4, while the sum is 9.

Adding to 1101120002001 its reverse (1002000211011), we get a palindrome (2103120213012).

The spelling of 1101120002001 in words is "one trillion, one hundred one billion, one hundred twenty million, two thousand, one".

Divisors: 1 3 9 43 129 387 2845271323 8535813969 25607441907 122346666889 367040000667 1101120002001