Base | Representation |
---|---|
bin | 11101001000111001101… |
… | …10001000100110010011 |
3 | 10112201022010202111222122 |
4 | 32210130312020212103 |
5 | 112400440100124021 |
6 | 2043541121324455 |
7 | 132222643625111 |
oct | 16443466104623 |
9 | 3481263674878 |
10 | 1001211333011 |
11 | 35667a77235a |
12 | 14205b79672b |
13 | 7354c22a536 |
14 | 3665d286ab1 |
15 | 1b09cc8ebab |
hex | e91cd88993 |
1001211333011 has 4 divisors (see below), whose sum is σ = 1001213530800. Its totient is φ = 1001209135224.
The previous prime is 1001211332921. The next prime is 1001211333019. The reversal of 1001211333011 is 1103331121001.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1001211333011 is a prime.
It is a super-2 number, since 2×10012113330112 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1001211333019) 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 3 ways as a sum of consecutive naturals, for example, 131951 + ... + 1421208.
It is an arithmetic number, because the mean of its divisors is an integer number (250303382700).
Almost surely, 21001211333011 is an apocalyptic number.
1001211333011 is a deficient number, since it is larger than the sum of its proper divisors (2197789).
1001211333011 is an equidigital number, since it uses as much as digits as its factorization.
1001211333011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2197788.
The product of its (nonzero) digits is 54, while the sum is 17.
Adding to 1001211333011 its reverse (1103331121001), we get a palindrome (2104542454012).
The spelling of 1001211333011 in words is "one trillion, one billion, two hundred eleven million, three hundred thirty-three thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •