Search a number
-
+
1010111011002 = 23318705759463
BaseRepresentation
bin11101011001011110100…
…11101101100010111010
310120120021101002000002000
432230233103231202322
5113022201404323002
62052012200321430
7132656330633142
oct16545723554272
93516241060060
101010111011002
1135a427372135
12143924173276
1374339c835a2
1436c65225922
151b41e25161c
hexeb2f4ed8ba

1010111011002 has 16 divisors (see below), whose sum is σ = 2244691135680. Its totient is φ = 336703670316.

The previous prime is 1010111010919. The next prime is 1010111011009. The reversal of 1010111011002 is 2001101110101.

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

It is not an unprimeable number, because it can be changed into a prime (1010111011009) 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, 9352879678 + ... + 9352879785.

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

Almost surely, 21010111011002 is an apocalyptic number.

1010111011002 is an abundant number, since it is smaller than the sum of its proper divisors (1234580124678).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

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

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

Adding to 1010111011002 its reverse (2001101110101), we get a palindrome (3011212121103).

Subtracting 1010111011002 from its reverse (2001101110101), we obtain a palindrome (990990099099).

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

Divisors: 1 2 3 6 9 18 27 54 18705759463 37411518926 56117278389 112234556778 168351835167 336703670334 505055505501 1010111011002