Base | Representation |
---|---|
bin | 11101001000100001111… |
… | …10001010101101011101 |
3 | 10112200210020220001102212 |
4 | 32210100332022231131 |
5 | 112400033100042341 |
6 | 2043505243330205 |
7 | 132215004364352 |
oct | 16442076125535 |
9 | 3480706801385 |
10 | 1001012112221 |
11 | 356588271880 |
12 | 142004b20965 |
13 | 73519b86b04 |
14 | 36640a28629 |
15 | 1b08a53b5eb |
hex | e910f8ab5d |
1001012112221 has 16 divisors (see below), whose sum is σ = 1117603322880. Its totient is φ = 888693286320.
The previous prime is 1001012112211. The next prime is 1001012112251. The reversal of 1001012112221 is 1222112101001.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1001012112221 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1001012112196 and 1001012112205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1001012112211) 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, 2580626 + ... + 2943068.
It is an arithmetic number, because the mean of its divisors is an integer number (69850207680).
Almost surely, 21001012112221 is an apocalyptic number.
1001012112221 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1001012112221 is a deficient number, since it is larger than the sum of its proper divisors (116591210659).
1001012112221 is a wasteful number, since it uses less digits than its factorization.
1001012112221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 368336.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 1001012112221 its reverse (1222112101001), we get a palindrome (2223124213222).
The spelling of 1001012112221 in words is "one trillion, one billion, twelve million, one hundred twelve thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •