Search a number
-
+
1102010101012 = 22436407035471
BaseRepresentation
bin10000000010010100111…
…010111010110100010100
310220100110222102110221101
4100002110322322310110
5121023404041213022
62202131220555444
7142421560206232
oct20022472726424
93810428373841
101102010101012
113953a5a776a7
121596b0b52b84
137cbc437b162
143b4a2431952
151d9ec1ab627
hex10094ebad14

1102010101012 has 12 divisors (see below), whose sum is σ = 1973366925376. Its totient is φ = 538190979480.

The previous prime is 1102010100967. The next prime is 1102010101033. The reversal of 1102010101012 is 2101010102011.

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

It is a congruent number.

It is an unprimeable number.

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 3 ways as a sum of consecutive naturals, for example, 3203517564 + ... + 3203517907.

Almost surely, 21102010101012 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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

Adding to 1102010101012 its reverse (2101010102011), we get a palindrome (3203020203023).

Subtracting 1102010101012 from its reverse (2101010102011), we obtain a palindrome (999000000999).

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

Divisors: 1 2 4 43 86 172 6407035471 12814070942 25628141884 275502525253 551005050506 1102010101012