Base | Representation |
---|---|
bin | 101111101111111010111000… |
… | …001000001000101011111100 |
3 | 1000112112220212002201101011210 |
4 | 233233322320020020223330 |
5 | 210011124444322023400 |
6 | 2022345121221444420 |
7 | 62143042000521255 |
oct | 5757727010105374 |
9 | 1015486762641153 |
10 | 210001220111100 |
11 | 60a05021039950 |
12 | 1b677787870710 |
13 | 9024051130722 |
14 | 39c0182bd9b2c |
15 | 1942931191950 |
hex | befeb8208afc |
210001220111100 has 144 divisors (see below), whose sum is σ = 669402990216576. Its totient is φ = 50405333280000.
The previous prime is 210001220110963. The next prime is 210001220111129. The reversal of 210001220111100 is 1111022100012.
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 polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 314700034 + ... + 315366633.
It is an arithmetic number, because the mean of its divisors is an integer number (4648631876504).
Almost surely, 2210001220111100 is an apocalyptic number.
210001220111100 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
210001220111100 is an abundant number, since it is smaller than the sum of its proper divisors (459401770105476).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
210001220111100 is a wasteful number, since it uses less digits than its factorization.
210001220111100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 630066796 (or 630066789 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 210001220111100 its reverse (1111022100012), we get a palindrome (211112242211112).
The spelling of 210001220111100 in words is "two hundred ten trillion, one billion, two hundred twenty million, one hundred eleven thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •