| Base | Representation |
|---|---|
| bin | 11001000000110110111110… |
| … | …111101000001011011000100 |
| 3 | 112102111212120001120021222100 |
| 4 | 121000312332331001123010 |
| 5 | 103404401342430120400 |
| 6 | 1025545553315032100 |
| 7 | 32112655222665123 |
| oct | 3100667675013304 |
| 9 | 472455501507870 |
| 10 | 110010201020100 |
| 11 | 32064078574617 |
| 12 | 1040886989b630 |
| 13 | 494cbc0812324 |
| 14 | 1d24744a6daba |
| 15 | cab94007c100 |
| hex | 640dbef416c4 |
110010201020100 has 216 divisors, whose sum is σ = 365142389157000. Its totient is φ = 27607533834240.
The previous prime is 110010201020059. The next prime is 110010201020119. The reversal of 110010201020100 is 1020102010011.
It is a happy number.
It can be written as a sum of positive squares in 12 ways, for example, as 5983542192384 + 104026658827716 = 2446128^2 + 10199346^2 .
It is a super-2 number, since 2×1100102010201002 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (9).
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 71 ways as a sum of consecutive naturals, for example, 148790934 + ... + 149528466.
It is an arithmetic number, because the mean of its divisors is an integer number (1690474023875).
Almost surely, 2110010201020100 is an apocalyptic number.
110010201020100 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 110010201020100, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (182571194578500).
110010201020100 is an abundant number, since it is smaller than the sum of its proper divisors (255132188136900).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110010201020100 is a wasteful number, since it uses less digits than its factorization.
110010201020100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 747319 (or 747309 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 110010201020100 its reverse (1020102010011), we get a palindrome (111030303030111).
The spelling of 110010201020100 in words is "one hundred ten trillion, ten billion, two hundred one million, twenty thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •