Base | Representation |
---|---|
bin | 11001000010011110010111… |
… | …000101000110101111100101 |
3 | 112102220111001211222200101011 |
4 | 121002132113011012233211 |
5 | 103413211210001400401 |
6 | 1030112551554102221 |
7 | 32123665010646220 |
oct | 3102362705065745 |
9 | 472814054880334 |
10 | 110121201200101 |
11 | 320a7159250773 |
12 | 1042628757a971 |
13 | 495a5002b0300 |
14 | 1d29c74a0a5b7 |
15 | cae789d8e451 |
hex | 642797146be5 |
110121201200101 has 48 divisors (see below), whose sum is σ = 144300049081344. Its totient is φ = 82000685325312.
The previous prime is 110121201200083. The next prime is 110121201200107. The reversal of 110121201200101 is 101002102121011.
It is a happy number.
It is not a de Polignac number, because 110121201200101 - 25 = 110121201200069 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110121201200107) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 673495980 + ... + 673659466.
It is an arithmetic number, because the mean of its divisors is an integer number (3006251022528).
Almost surely, 2110121201200101 is an apocalyptic number.
It is an amenable number.
110121201200101 is a deficient number, since it is larger than the sum of its proper divisors (34178847881243).
110121201200101 is a wasteful number, since it uses less digits than its factorization.
110121201200101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 197030 (or 197017 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 110121201200101 its reverse (101002102121011), we get a palindrome (211123303321112).
The spelling of 110121201200101 in words is "one hundred ten trillion, one hundred twenty-one billion, two hundred one million, two hundred thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •