Base | Representation |
---|---|
bin | 11001000011110011000111… |
… | …101111110011001111100001 |
3 | 112110020011222112212221202021 |
4 | 121003303013233303033201 |
5 | 103421204102233341001 |
6 | 1030222442523421441 |
7 | 32133366233044231 |
oct | 3103630757631741 |
9 | 473204875787667 |
10 | 110212212012001 |
11 | 321318114aa7a0 |
12 | 1043ba46984881 |
13 | 4965c75656a28 |
14 | 1d30429c6bcc1 |
15 | cb1d14d35ba1 |
hex | 643cc7bf33e1 |
110212212012001 has 8 divisors (see below), whose sum is σ = 121582419789600. Its totient is φ = 99067156863840.
The previous prime is 110212212011981. The next prime is 110212212012017. The reversal of 110212212012001 is 100210212212011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 110212212012001 - 229 = 110211675141089 is a prime.
It is not an unprimeable number, because it can be changed into a prime (110212212015001) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 56288156331 + ... + 56288158288.
It is an arithmetic number, because the mean of its divisors is an integer number (15197802473700).
Almost surely, 2110212212012001 is an apocalyptic number.
110212212012001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
110212212012001 is a deficient number, since it is larger than the sum of its proper divisors (11370207777599).
110212212012001 is a wasteful number, since it uses less digits than its factorization.
110212212012001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 112576314719.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 110212212012001 its reverse (100210212212011), we get a palindrome (210422424224012).
The spelling of 110212212012001 in words is "one hundred ten trillion, two hundred twelve billion, two hundred twelve million, twelve thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •