Base | Representation |
---|---|
bin | 11001000011110001000101… |
… | …000110010111011010000010 |
3 | 112110012222022210102220012211 |
4 | 121003301011012113122002 |
5 | 103421140110122041002 |
6 | 1030221441223412334 |
7 | 32133261016152226 |
oct | 3103610506273202 |
9 | 473188283386184 |
10 | 110210020112002 |
11 | 32130897202898 |
12 | 1043b5348b40aa |
13 | 49659b6500195 |
14 | 1d3029cadc786 |
15 | cb1c376b8dd7 |
hex | 643c45197682 |
110210020112002 has 4 divisors (see below), whose sum is σ = 165315030168006. Its totient is φ = 55105010056000.
The previous prime is 110210020111999. The next prime is 110210020112009. The reversal of 110210020112002 is 200211020012011.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in only one way, i.e., 92434360689841 + 17775659422161 = 9614279^2 + 4216119^2 .
It is not an unprimeable number, because it can be changed into a prime (110210020112009) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 27552505027999 + ... + 27552505028002.
Almost surely, 2110210020112002 is an apocalyptic number.
110210020112002 is a deficient number, since it is larger than the sum of its proper divisors (55105010056004).
110210020112002 is an equidigital number, since it uses as much as digits as its factorization.
110210020112002 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 55105010056003.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 110210020112002 its reverse (200211020012011), we get a palindrome (310421040124013).
Subtracting 110210020112002 from its reverse (200211020012011), we obtain a palindrome (90000999900009).
The spelling of 110210020112002 in words is "one hundred ten trillion, two hundred ten billion, twenty million, one hundred twelve thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •