Base | Representation |
---|---|
bin | 10000001001110001111… |
… | …000111101110111000101 |
3 | 10221010010200000101101122 |
4 | 100021301320331313011 |
5 | 121141301123234341 |
6 | 2205533240203325 |
7 | 143124066024266 |
oct | 20116170756705 |
9 | 3833120011348 |
10 | 1110012321221 |
11 | 398832021131 |
12 | 15b164a69545 |
13 | 8089b1ba9bb |
14 | 3ba2111696d |
15 | 1dd1999494b |
hex | 10271e3ddc5 |
1110012321221 has 2 divisors, whose sum is σ = 1110012321222. Its totient is φ = 1110012321220.
The previous prime is 1110012321203. The next prime is 1110012321287. The reversal of 1110012321221 is 1221232100111.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 651935130625 + 458077190596 = 807425^2 + 676814^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1110012321221 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1110012321221.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1110012321721) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 555006160610 + 555006160611.
It is an arithmetic number, because the mean of its divisors is an integer number (555006160611).
Almost surely, 21110012321221 is an apocalyptic number.
It is an amenable number.
1110012321221 is a deficient number, since it is larger than the sum of its proper divisors (1).
1110012321221 is an equidigital number, since it uses as much as digits as its factorization.
1110012321221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 1110012321221 its reverse (1221232100111), we get a palindrome (2331244421332).
The spelling of 1110012321221 in words is "one trillion, one hundred ten billion, twelve million, three hundred twenty-one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •