Search a number
-
+
101100112002 = 23214629383941
BaseRepresentation
bin101111000101000001…
…0010100100010000010
3100122221211200211012200
41132022002110202002
53124023112041002
6114240022134030
710206232526061
oct1361202244202
9318854624180
10101100112002
113997041757a
1217716281316
1396c26cc3a6
144c711cc1d8
15296aae3b1c
hex178a094882

101100112002 has 24 divisors (see below), whose sum is σ = 219065786940. Its totient is φ = 33697645920.

The previous prime is 101100111979. The next prime is 101100112033. The reversal of 101100112002 is 200211001101.

It is a happy number.

It can be written as a sum of positive squares in 2 ways, for example, as 90697947921 + 10402164081 = 301161^2 + 101991^2 .

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

It is an unprimeable number.

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

It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 71352 + ... + 455292.

Almost surely, 2101100112002 is an apocalyptic number.

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

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

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

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

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

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

Adding to 101100112002 its reverse (200211001101), we get a palindrome (301311113103).

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

Divisors: 1 2 3 6 9 18 14629 29258 43887 87774 131661 263322 383941 767882 1151823 2303646 3455469 6910938 5616672889 11233345778 16850018667 33700037334 50550056001 101100112002