Search a number
2000000111022 = 233192784770001
BaseRepresentation
bin11101000110101001010…
…010111101000110101110
321002012100110001111021000
4131012221102331012232
5230232000012023042
64130442023221130
7264331603306524
oct35065122750656
97065313044230
102000000111022
11701216a17241
12283743ba77a6
131167a35a2a74
146cb2c8bc314
153705800074c
hex1d1a94bd1ae

2000000111022 has 64 divisors (see below), whose sum is σ = 4678597670400. Its totient is φ = 631547280000.

The previous prime is 2000000111017. The next prime is 2000000111063. The reversal of 2000000111022 is 2201110000002.

It is a super-3 number, since 3×20000001110223 (a number of 38 digits) contains 333 as substring.

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

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

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 28536022 + ... + 28606022.

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

Almost surely, 22000000111022 is an apocalyptic number.

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

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

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

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

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

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

Adding to 2000000111022 its reverse (2201110000002), we get a palindrome (4201110111024).

The spelling of 2000000111022 in words is "two trillion, one hundred eleven thousand, twenty-two".