Base | Representation |
---|---|
bin | 101111110000010111111100… |
… | …011100111111101101010110 |
3 | 1000112122220102020220000201110 |
4 | 233300113330130333231112 |
5 | 210012132404341413420 |
6 | 2022411322235435450 |
7 | 62145225304434630 |
oct | 5760277434775526 |
9 | 1015586366800643 |
10 | 210032431201110 |
11 | 60a17287973811 |
12 | 1b6818382b5b86 |
13 | 9026c863a0a1b |
14 | 39c18a401da50 |
15 | 194365b296ee0 |
hex | bf05fc73fb56 |
210032431201110 has 64 divisors (see below), whose sum is σ = 577234260513792. Its totient is φ = 47911970649216.
The previous prime is 210032431201081. The next prime is 210032431201121. The reversal of 210032431201110 is 11102134230012.
It is a super-2 number, since 2×2100324312011102 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 994083669 + ... + 994294928.
It is an arithmetic number, because the mean of its divisors is an integer number (9019285320528).
Almost surely, 2210032431201110 is an apocalyptic number.
210032431201110 is an abundant number, since it is smaller than the sum of its proper divisors (367201829312682).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
210032431201110 is a wasteful number, since it uses less digits than its factorization.
210032431201110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1988379117.
The product of its (nonzero) digits is 288, while the sum is 21.
Adding to 210032431201110 its reverse (11102134230012), we get a palindrome (221134565431122).
The spelling of 210032431201110 in words is "two hundred ten trillion, thirty-two billion, four hundred thirty-one million, two hundred one thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •