Search a number
-
+
101320000200 = 23345223271927
BaseRepresentation
bin101111001011100100…
…1001000001011001000
3100200112011110022010000
41132113021020023020
53130000410001300
6114313515123000
710214542535406
oct1362711101310
9320464408100
10101320000200
1139a73553861
1217777a43460
13972912ac53
144c924aa476
15298007ac00
hex17972482c8

101320000200 has 240 divisors, whose sum is σ = 367200694080. Its totient is φ = 25843847040.

The previous prime is 101320000183. The next prime is 101320000237. The reversal of 101320000200 is 2000023101.

It is a happy number.

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

It is an unprimeable number.

It is a polite number, since it can be written in 59 ways as a sum of consecutive naturals, for example, 236637 + ... + 508563.

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

Almost surely, 2101320000200 is an apocalyptic number.

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

It is an amenable number.

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

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

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

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

101320000200 is an evil number, because the sum of its binary digits is even.

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

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

Adding to 101320000200 its reverse (2000023101), we get a palindrome (103320023301).

The spelling of 101320000200 in words is "one hundred one billion, three hundred twenty million, two hundred", and thus it is an aban number.