Base | Representation |
---|---|
bin | 11001000010011110010111… |
… | …000101001011110110001001 |
3 | 112102220111001212000202001020 |
4 | 121002132113011023312021 |
5 | 103413211210003033001 |
6 | 1030112551554343053 |
7 | 32123665011064155 |
oct | 3102362705136611 |
9 | 472814055022036 |
10 | 110121201221001 |
11 | 320a7159265443 |
12 | 1042628758aa89 |
13 | 495a5002b9989 |
14 | 1d29c74a14065 |
15 | cae789d95736 |
hex | 64279714bd89 |
110121201221001 has 8 divisors (see below), whose sum is σ = 146835797641344. Its totient is φ = 73410369474000.
The previous prime is 110121201220997. The next prime is 110121201221063. The reversal of 110121201221001 is 100122102121011.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 110121201221001 - 22 = 110121201220997 is a prime.
It is not an unprimeable number, because it can be changed into a prime (110121201223001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 941100081 + ... + 941217086.
It is an arithmetic number, because the mean of its divisors is an integer number (18354474705168).
Almost surely, 2110121201221001 is an apocalyptic number.
It is an amenable number.
110121201221001 is a deficient number, since it is larger than the sum of its proper divisors (36714596420343).
110121201221001 is a wasteful number, since it uses less digits than its factorization.
110121201221001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1882336671.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 110121201221001 its reverse (100122102121011), we get a palindrome (210243303342012).
The spelling of 110121201221001 in words is "one hundred ten trillion, one hundred twenty-one billion, two hundred one million, two hundred twenty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •