Search a number
-
+
101102000112002 = 2320031579570667
BaseRepresentation
bin10110111111001110100100…
…110011011000000110000010
3111020222020221012221111212202
4112333032210303120012002
5101222423344012041002
6555005341225353202
730203243545426151
oct2677164463300602
9436866835844782
10101102000112002
112a23a13238099a
12b40a2b3338802
134454b54407536
141ad7511ba3598
15ba4d65b56502
hex5bf3a4cd8182

101102000112002 has 8 divisors (see below), whose sum is σ = 151657738976016. Its totient is φ = 50549420453332.

The previous prime is 101102000111977. The next prime is 101102000112017. The reversal of 101102000112002 is 200211000201101.

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

It is a super-2 number, since 2×1011020001120022 (a number of 29 digits) contains 22 as substring.

It is an unprimeable number.

It is a pernicious number, because its binary representation contains a prime number (23) of ones.

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

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

Almost surely, 2101102000112002 is an apocalyptic number.

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

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

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

The sum of its prime factors is 1579602672.

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

Adding to 101102000112002 its reverse (200211000201101), we get a palindrome (301313000313103).

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

Divisors: 1 2 32003 64006 1579570667 3159141334 50551000056001 101102000112002