Search a number
-
+
101020021212000 = 2535311765303191
BaseRepresentation
bin10110111110000010001110…
…011110101100001101100000
3111020200102022222011220102010
4112332002032132230031200
5101220103000412241000
6554503542421152520
730164312204322612
oct2676021636541540
9436612288156363
10101020021212000
112a208394429a70
12b3b643485b740
13444a1bb305397
141ad35762a2db2
15ba2b68a91d50
hex5be08e7ac360

101020021212000 has 192 divisors, whose sum is σ = 361027189006848. Its totient is φ = 24489702080000.

The previous prime is 101020021211917. The next prime is 101020021212029. The reversal of 101020021212000 is 212120020101.

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

It is a congruent number.

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 31 ways as a sum of consecutive naturals, for example, 382519596 + ... + 382783595.

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

Almost surely, 2101020021212000 is an apocalyptic number.

101020021212000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.

It is an amenable number.

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

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

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

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

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

The product of its (nonzero) digits is 16, while the sum is 12.

Adding to 101020021212000 its reverse (212120020101), we get a palindrome (101232141232101).

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