Search a number
-
+
102000111111110 = 2510200011111111
BaseRepresentation
bin10111001100010011000000…
…011000111100101111000110
3111101011010010010020102001002
4113030103000120330233012
5101332132211421023420
61000534112033133302
730325156561110362
oct2714230030745706
9441133103212032
10102000111111110
112a556005648423
12b53437a9ba232
1344bb752711324
141b28b903462a2
15bbd3cc3e9075
hex5cc4c063cbc6

102000111111110 has 8 divisors (see below), whose sum is σ = 183600200000016. Its totient is φ = 40800044444440.

The previous prime is 102000111111091. The next prime is 102000111111131. The reversal of 102000111111110 is 11111111000201.

It is a happy number.

It is a sphenic number, since it is the product of 3 distinct primes.

It is a junction number, because it is equal to n+sod(n) for n = 102000111111091 and 102000111111100.

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5100005555546 + ... + 5100005555565.

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

Almost surely, 2102000111111110 is an apocalyptic number.

102000111111110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.

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

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

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

The sum of its prime factors is 10200011111118.

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

Adding to 102000111111110 its reverse (11111111000201), we get a palindrome (113111222111311).

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

Divisors: 1 2 5 10 10200011111111 20400022222222 51000055555555 102000111111110