Search a number
-
+
11010101102002 = 257712301775613
BaseRepresentation
bin1010000000110111110100…
…1010100100010110110010
31102222112222212122211022101
42200031331022210112302
52420342141340231002
635225545353131014
72214311366140312
oct240157512442662
942875885584271
1011010101102002
1135653a30483a2
1212999b86b9a6a
1361b32c04c7a2
142a0c6acd5442
151415e8388587
hexa037d2a45b2

11010101102002 has 16 divisors (see below), whose sum is σ = 16545140344152. Its totient is φ = 5495055897600.

The previous prime is 11010101101963. The next prime is 11010101102009. The reversal of 11010101102002 is 20020110101011.

It can be written as a sum of positive squares in 4 ways, for example, as 10468583199361 + 541517902641 = 3235519^2 + 735879^2 .

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

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

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

Almost surely, 211010101102002 is an apocalyptic number.

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

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

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

The sum of its prime factors is 788493.

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

Adding to 11010101102002 its reverse (20020110101011), we get a palindrome (31030211203013).

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

Divisors: 1 2 577 1154 12301 24602 775613 1551226 7097677 14195354 447528701 895057402 9540815513 19081631026 5505050551001 11010101102002