Base | Representation |
---|---|
bin | 11001000011110001001111… |
… | …110100111110010001110001 |
3 | 112110012222210100010100002002 |
4 | 121003301033310332101301 |
5 | 103421140442211231001 |
6 | 1030221511133303345 |
7 | 32133265333066346 |
oct | 3103611764762161 |
9 | 473188710110062 |
10 | 110210200102001 |
11 | 32130979868a5a |
12 | 1043b585034b55 |
13 | 4965a1489c63c |
14 | 1d302b89927cd |
15 | cb1c483be46b |
hex | 643c4fd3e471 |
110210200102001 has 4 divisors (see below), whose sum is σ = 110231780330352. Its totient is φ = 110188619873652.
The previous prime is 110210200101973. The next prime is 110210200102003. The reversal of 110210200102001 is 100201002012011.
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 110210200102001 - 214 = 110210200085617 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (110210200102003) 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, 10790106515 + ... + 10790116728.
It is an arithmetic number, because the mean of its divisors is an integer number (27557945082588).
Almost surely, 2110210200102001 is an apocalyptic number.
It is an amenable number.
110210200102001 is a deficient number, since it is larger than the sum of its proper divisors (21580228351).
110210200102001 is an equidigital number, since it uses as much as digits as its factorization.
110210200102001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21580228350.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 110210200102001 its reverse (100201002012011), we get a palindrome (210411202114012).
The spelling of 110210200102001 in words is "one hundred ten trillion, two hundred ten billion, two hundred million, one hundred two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •