Base | Representation |
---|---|
bin | 11001000011101010101111… |
… | …110010000000000011101001 |
3 | 112110012022202212211110120211 |
4 | 121003222233302000003221 |
5 | 103421032143310013001 |
6 | 1030214354345421121 |
7 | 32132630345155561 |
oct | 3103525762000351 |
9 | 473168685743524 |
10 | 110203220001001 |
11 | 32128a17775846 |
12 | 1043a15749a7a1 |
13 | 4965171742b6a |
14 | 1d2dc15935da1 |
15 | cb198a6d6351 |
hex | 643aafc800e9 |
110203220001001 has 4 divisors (see below), whose sum is σ = 111273154175872. Its totient is φ = 109133285826132.
The previous prime is 110203220000999. The next prime is 110203220001053. The reversal of 110203220001001 is 100100022302011.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 110203220001001 - 21 = 110203220000999 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (110203220001701) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 534967087281 + ... + 534967087486.
It is an arithmetic number, because the mean of its divisors is an integer number (27818288543968).
Almost surely, 2110203220001001 is an apocalyptic number.
It is an amenable number.
110203220001001 is a deficient number, since it is larger than the sum of its proper divisors (1069934174871).
110203220001001 is a wasteful number, since it uses less digits than its factorization.
110203220001001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1069934174870.
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 110203220001001 its reverse (100100022302011), we get a palindrome (210303242303012).
The spelling of 110203220001001 in words is "one hundred ten trillion, two hundred three billion, two hundred twenty million, one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •