Base | Representation |
---|---|
bin | 110011010001110111… |
… | …0101010101010110001 |
3 | 101112020112021121002101 |
4 | 1212203232222222301 |
5 | 3301012000231001 |
6 | 122331113220401 |
7 | 10645621631341 |
oct | 1464356525261 |
9 | 345215247071 |
10 | 110121102001 |
11 | 4277a544909 |
12 | 19413401701 |
13 | a4cc61b5b1 |
14 | 5489308d21 |
15 | 2ce7a69a01 |
hex | 19a3baaab1 |
110121102001 has 4 divisors (see below), whose sum is σ = 110822510452. Its totient is φ = 109419693552.
The previous prime is 110121101999. The next prime is 110121102019. The reversal of 110121102001 is 100201121011.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 100201121011 = 1109 ⋅90352679.
It can be written as a sum of positive squares in 2 ways, for example, as 12061310976 + 98059791025 = 109824^2 + 313145^2 .
It is a cyclic number.
It is not a de Polignac number, because 110121102001 - 21 = 110121101999 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (110121102401) 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, 350703990 + ... + 350704303.
It is an arithmetic number, because the mean of its divisors is an integer number (27705627613).
Almost surely, 2110121102001 is an apocalyptic number.
It is an amenable number.
110121102001 is a deficient number, since it is larger than the sum of its proper divisors (701408451).
110121102001 is an equidigital number, since it uses as much as digits as its factorization.
110121102001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 701408450.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 110121102001 its reverse (100201121011), we get a palindrome (210322223012).
The spelling of 110121102001 in words is "one hundred ten billion, one hundred twenty-one million, one hundred two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •