Base | Representation |
---|---|
bin | 10000001001111101001… |
… | …010010101000010110001 |
3 | 10221010121211211200220020 |
4 | 100021331022111002301 |
5 | 121142143031001001 |
6 | 2210004113234053 |
7 | 143131553245440 |
oct | 20117512250261 |
9 | 3833554750806 |
10 | 1110201422001 |
11 | 39891983a371 |
12 | 15b1b8262929 |
13 | 808cb42a059 |
14 | 3ba3c29cd57 |
15 | 1dd2b399736 |
hex | 1027d2950b1 |
1110201422001 has 64 divisors (see below), whose sum is σ = 1722694514688. Its totient is φ = 622895804928.
The previous prime is 1110201421993. The next prime is 1110201422027. The reversal of 1110201422001 is 1002241020111.
It is not a de Polignac number, because 1110201422001 - 23 = 1110201421993 is a prime.
It is not an unprimeable number, because it can be changed into a prime (1110201422201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 258364485 + ... + 258368781.
It is an arithmetic number, because the mean of its divisors is an integer number (26917101792).
Almost surely, 21110201422001 is an apocalyptic number.
It is an amenable number.
1110201422001 is a deficient number, since it is larger than the sum of its proper divisors (612493092687).
1110201422001 is a wasteful number, since it uses less digits than its factorization.
1110201422001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5270.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 1110201422001 its reverse (1002241020111), we get a palindrome (2112442442112).
The spelling of 1110201422001 in words is "one trillion, one hundred ten billion, two hundred one million, four hundred twenty-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •