Search a number
-
+
1102200011001 = 32424912882179
BaseRepresentation
bin10000000010100000001…
…111010111100011111001
310220100222012202220110200
4100002200033113203321
5121024301200323001
62202202123232413
7142426354340535
oct20024017274371
93810865686420
101102200011001
11395493198901
12159744678709
137cc2481192b
143b4bd748bc5
151da0dbc1086
hex100a03d78f9

1102200011001 has 12 divisors (see below), whose sum is σ = 1592104703280. Its totient is φ = 734782459320.

The previous prime is 1102200010993. The next prime is 1102200011023. The reversal of 1102200011001 is 1001100022011.

It is a happy number.

It is not a de Polignac number, because 1102200011001 - 23 = 1102200010993 is a prime.

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

It is a Curzon number.

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

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

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

Almost surely, 21102200011001 is an apocalyptic number.

It is an amenable number.

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

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

1102200011001 is an evil number, because the sum of its binary digits is even.

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

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

Adding to 1102200011001 its reverse (1001100022011), we get a palindrome (2103300033012).

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

Divisors: 1 3 9 42491 127473 382419 2882179 8646537 25939611 122466667889 367400003667 1102200011001