Base | Representation |
---|---|
bin | 11001000011110011000111… |
… | …101111110010110000010001 |
3 | 112110020011222112212212000012 |
4 | 121003303013233302300101 |
5 | 103421204102233310001 |
6 | 1030222442523404305 |
7 | 32133366233035343 |
oct | 3103630757626021 |
9 | 473204875785005 |
10 | 110212212010001 |
11 | 321318114a9242 |
12 | 1043ba46983695 |
13 | 4965c75655b4a |
14 | 1d30429c6b293 |
15 | cb1d14d352bb |
hex | 643cc7bf2c11 |
110212212010001 has 8 divisors (see below), whose sum is σ = 113891873709504. Its totient is φ = 106583304265200.
The previous prime is 110212212009929. The next prime is 110212212010013. The reversal of 110212212010001 is 100010212212011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-110212212010001 is a prime.
It is a super-2 number, since 2×1102122120100012 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (110212212010081) 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, 12688484261 + ... + 12688492946.
It is an arithmetic number, because the mean of its divisors is an integer number (14236484213688).
Almost surely, 2110212212010001 is an apocalyptic number.
It is an amenable number.
110212212010001 is a deficient number, since it is larger than the sum of its proper divisors (3679661699503).
110212212010001 is a wasteful number, since it uses less digits than its factorization.
110212212010001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 25376977351.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 110212212010001 its reverse (100010212212011), we get a palindrome (210222424222012).
The spelling of 110212212010001 in words is "one hundred ten trillion, two hundred twelve billion, two hundred twelve million, ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.112 sec. • engine limits •