Base | Representation |
---|---|
bin | 11001000011110001010001… |
… | …000001010001000101110001 |
3 | 112110012222211201202102220211 |
4 | 121003301101001101011301 |
5 | 103421141012321231001 |
6 | 1030221513130104121 |
7 | 32133265665065365 |
oct | 3103612101210561 |
9 | 473188751672824 |
10 | 110210220102001 |
11 | 3213098a089288 |
12 | 1043b58b87b041 |
13 | 4965a18a82a66 |
14 | 1d302bb4bb2a5 |
15 | cb1c4a020351 |
hex | 643c51051171 |
110210220102001 has 8 divisors (see below), whose sum is σ = 115002127450944. Its totient is φ = 105418325973840.
The previous prime is 110210220101981. The next prime is 110210220102041. The reversal of 110210220102001 is 100201022012011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 110210220102001 - 231 = 110208072618353 is a prime.
It is a super-2 number, since 2×1102102201020012 (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 (110210220102041) 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, 16171546 + ... + 21953116.
It is an arithmetic number, because the mean of its divisors is an integer number (14375265931368).
Almost surely, 2110210220102001 is an apocalyptic number.
It is an amenable number.
110210220102001 is a deficient number, since it is larger than the sum of its proper divisors (4791907348943).
110210220102001 is an equidigital number, since it uses as much as digits as its factorization.
110210220102001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6610391.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 110210220102001 its reverse (100201022012011), we get a palindrome (210411242114012).
The spelling of 110210220102001 in words is "one hundred ten trillion, two hundred ten billion, two hundred twenty million, one hundred two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •