Base | Representation |
---|---|
bin | 101110101110000110… |
… | …0110001110000010000 |
3 | 100120222020200000201010 |
4 | 1131130030301300100 |
5 | 3120434230214300 |
6 | 114031431410520 |
7 | 10151204201061 |
oct | 1353414616020 |
9 | 316866600633 |
10 | 100331101200 |
11 | 39606322360 |
12 | 17540823a40 |
13 | 95cc2a9805 |
14 | 4bdb00c568 |
15 | 292333da50 |
hex | 175c331c10 |
100331101200 has 240 divisors, whose sum is σ = 352852076736. Its totient is φ = 24167270400.
The previous prime is 100331101151. The next prime is 100331101223. The reversal of 100331101200 is 2101133001.
It is a tau number, because it is divible by the number of its divisors (240).
It is a Harshad number since it is a multiple of its sum of digits (12).
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 2048194 + ... + 2096606.
Almost surely, 2100331101200 is an apocalyptic number.
100331101200 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 100331101200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (176426038368).
100331101200 is an abundant number, since it is smaller than the sum of its proper divisors (252520975536).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100331101200 is a wasteful number, since it uses less digits than its factorization.
100331101200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 48602 (or 48591 counting only the distinct ones).
The product of its (nonzero) digits is 18, while the sum is 12.
Adding to 100331101200 its reverse (2101133001), we get a palindrome (102432234201).
The spelling of 100331101200 in words is "one hundred billion, three hundred thirty-one million, one hundred one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •