Search a number
-
+
101201112002 = 2739203933581
BaseRepresentation
bin101111001000000001…
…1100110101111000010
3100200012212202011011102
41132100003212233002
53124224441041002
6114254031014402
710211600154524
oct1362003465702
9320185664142
10101201112002
1139a12431351
121774406a402
13970a6030c3
144c8079da14
1529748e4a02
hex17900e6bc2

101201112002 has 16 divisors (see below), whose sum is σ = 152086161600. Its totient is φ = 50505797520.

The previous prime is 101201111983. The next prime is 101201112007. The reversal of 101201112002 is 200211102101.

It is not an unprimeable number, because it can be changed into a prime (101201112007) by changing a digit.

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2996852 + ... + 3030432.

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

Almost surely, 2101201112002 is an apocalyptic number.

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

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

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

The sum of its prime factors is 36361.

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

Adding to 101201112002 its reverse (200211102101), we get a palindrome (301412214103).

Subtracting 101201112002 from its reverse (200211102101), we obtain a palindrome (99009990099).

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

Divisors: 1 2 739 1478 2039 4078 33581 67162 1506821 3013642 24816359 49632718 68471659 136943318 50600556001 101201112002