Base | Representation |
---|---|
bin | 11101001000111000010… |
… | …11101111101101010011 |
3 | 10112201021100211222012002 |
4 | 32210130023233231103 |
5 | 112400424224033021 |
6 | 2043540043224215 |
7 | 132222450314444 |
oct | 16443413575523 |
9 | 3481240758162 |
10 | 1001200221011 |
11 | 356674472791 |
12 | 142057b1806b |
13 | 73549b397a3 |
14 | 3665b9d32cb |
15 | 1b09bce750b |
hex | e91c2efb53 |
1001200221011 has 8 divisors (see below), whose sum is σ = 1020473404944. Its totient is φ = 982109721600.
The previous prime is 1001200220963. The next prime is 1001200221019. The reversal of 1001200221011 is 1101220021001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1001200221011 - 218 = 1001199958867 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1001200220983 and 1001200221001.
It is not an unprimeable number, because it can be changed into a prime (1001200221019) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 45660065 + ... + 45681986.
It is an arithmetic number, because the mean of its divisors is an integer number (127559175618).
Almost surely, 21001200221011 is an apocalyptic number.
1001200221011 is a deficient number, since it is larger than the sum of its proper divisors (19273183933).
1001200221011 is an equidigital number, since it uses as much as digits as its factorization.
1001200221011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 91342261.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 1001200221011 its reverse (1101220021001), we get a palindrome (2102420242012).
The spelling of 1001200221011 in words is "one trillion, one billion, two hundred million, two hundred twenty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •