Base | Representation |
---|---|
bin | 11101000111000011101… |
… | …01000101001001101001 |
3 | 10112121202010122121012201 |
4 | 32203201311011021221 |
5 | 112341423111413001 |
6 | 2043254551340201 |
7 | 132156261633631 |
oct | 16434165051151 |
9 | 3477663577181 |
10 | 1000221201001 |
11 | 356211879540 |
12 | 141a24081661 |
13 | 73422066ac9 |
14 | 365a79876c1 |
15 | 1b040dac501 |
hex | e8e1d45269 |
1000221201001 has 8 divisors (see below), whose sum is σ = 1091157650208. Its totient is φ = 909285960000.
The previous prime is 1000221200939. The next prime is 1000221201017. The reversal of 1000221201001 is 1001021220001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1000221201001 - 211 = 1000221198953 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1000221201101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2971441 + ... + 3290881.
It is an arithmetic number, because the mean of its divisors is an integer number (136394706276).
Almost surely, 21000221201001 is an apocalyptic number.
1000221201001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1000221201001 is a deficient number, since it is larger than the sum of its proper divisors (90936449207).
1000221201001 is a wasteful number, since it uses less digits than its factorization.
1000221201001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 604103.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 1000221201001 its reverse (1001021220001), we get a palindrome (2001242421002).
The spelling of 1000221201001 in words is "one trillion, two hundred twenty-one million, two hundred one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •