Base | Representation |
---|---|
bin | 11001000010001010101110… |
… | …100011001011001010010001 |
3 | 112102211110122200012221202210 |
4 | 121002022232203023022101 |
5 | 103412340021222401001 |
6 | 1030055144045302333 |
7 | 32122320420515142 |
oct | 3102125643131221 |
9 | 472743580187683 |
10 | 110100120122001 |
11 | 32099220560779 |
12 | 104221835649a9 |
13 | 495852094b4b9 |
14 | 1d28c34d0dac9 |
15 | cade54278dd6 |
hex | 6422ae8cb291 |
110100120122001 has 4 divisors (see below), whose sum is σ = 146800160162672. Its totient is φ = 73400080081332.
The previous prime is 110100120121991. The next prime is 110100120122009. The reversal of 110100120122001 is 100221021001011.
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 not a de Polignac number, because 110100120122001 - 215 = 110100120089233 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (110100120122009) 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, 18350020020331 + ... + 18350020020336.
It is an arithmetic number, because the mean of its divisors is an integer number (36700040040668).
Almost surely, 2110100120122001 is an apocalyptic number.
It is an amenable number.
110100120122001 is a deficient number, since it is larger than the sum of its proper divisors (36700040040671).
110100120122001 is an equidigital number, since it uses as much as digits as its factorization.
110100120122001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 36700040040670.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 110100120122001 its reverse (100221021001011), we get a palindrome (210321141123012).
The spelling of 110100120122001 in words is "one hundred ten trillion, one hundred billion, one hundred twenty million, one hundred twenty-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •