Search a number
-
+
101020012002 = 23572131512161
BaseRepresentation
bin101111000010101000…
…0110000110111100010
3100122202020222022200000
41132011100300313202
53123342110341002
6114224041240430
710204240635300
oct1360520606742
9318666868600
10101020012002
113992a188228
12176b3493116
1396abc35640
144c646db270
152963a7061c
hex1785430de2

101020012002 has 288 divisors, whose sum is σ = 286368211584. Its totient is φ = 26453952000.

The previous prime is 101020012001. The next prime is 101020012007. The reversal of 101020012002 is 200210020101.

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

It is not an unprimeable number, because it can be changed into a prime (101020012001) 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 143 ways as a sum of consecutive naturals, for example, 46745802 + ... + 46747962.

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

Almost surely, 2101020012002 is an apocalyptic number.

It is a practical number, because each smaller number is the sum of distinct divisors of 101020012002, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (143184105792).

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

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

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

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

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

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

Adding to 101020012002 its reverse (200210020101), we get a palindrome (301230032103).

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