Base | Representation |
---|---|
bin | 11001000000101111011101… |
… | …011011001100000111101001 |
3 | 112102111002201001001022021122 |
4 | 121000233131123030013221 |
5 | 103404233321302410441 |
6 | 1025542135524145025 |
7 | 32112251065043606 |
oct | 3100573533140751 |
9 | 472432631038248 |
10 | 110002122310121 |
11 | 320607023271a8 |
12 | 10407194238175 |
13 | 494c203ba1072 |
14 | 1d241b9b576ad |
15 | cab61abd534b |
hex | 640bdd6cc1e9 |
110002122310121 has 16 divisors (see below), whose sum is σ = 115935224832000. Its totient is φ = 104232437130000.
The previous prime is 110002122310109. The next prime is 110002122310123. The reversal of 110002122310121 is 121013221200011.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 110002122310121 - 214 = 110002122293737 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 110002122310121.
It is not an unprimeable number, because it can be changed into a prime (110002122310123) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 119348321 + ... + 120266478.
It is an arithmetic number, because the mean of its divisors is an integer number (7245951552000).
Almost surely, 2110002122310121 is an apocalyptic number.
It is an amenable number.
110002122310121 is a deficient number, since it is larger than the sum of its proper divisors (5933102521879).
110002122310121 is a wasteful number, since it uses less digits than its factorization.
110002122310121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 239615140.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 110002122310121 its reverse (121013221200011), we get a palindrome (231015343510132).
The spelling of 110002122310121 in words is "one hundred ten trillion, two billion, one hundred twenty-two million, three hundred ten thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •