Base | Representation |
---|---|
bin | 11001000010001100100101… |
… | …110000011111100100111001 |
3 | 112102211122211001112110211112 |
4 | 121002030211300133210321 |
5 | 103412403120221232301 |
6 | 1030100114332010105 |
7 | 32122421114205203 |
oct | 3102144560374471 |
9 | 472748731473745 |
10 | 110102120102201 |
11 | 3209a057494477 |
12 | 10422641300935 |
13 | 495877c0b9836 |
14 | 1d28d847a1773 |
15 | cae01eb359bb |
hex | 642325c1f939 |
110102120102201 has 4 divisors (see below), whose sum is σ = 110102424453504. Its totient is φ = 110101815750900.
The previous prime is 110102120102171. The next prime is 110102120102239. The reversal of 110102120102201 is 102201021201011.
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 110102120102201 - 210 = 110102120101177 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (110102120102101) 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, 151632365 + ... + 152356746.
It is an arithmetic number, because the mean of its divisors is an integer number (27525606113376).
Almost surely, 2110102120102201 is an apocalyptic number.
It is an amenable number.
110102120102201 is a deficient number, since it is larger than the sum of its proper divisors (304351303).
110102120102201 is an equidigital number, since it uses as much as digits as its factorization.
110102120102201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 304351302.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 110102120102201 its reverse (102201021201011), we get a palindrome (212303141303212).
The spelling of 110102120102201 in words is "one hundred ten trillion, one hundred two billion, one hundred twenty million, one hundred two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •