Base | Representation |
---|---|
bin | 11101001000111001101… |
… | …00111010000000011101 |
3 | 10112201022010011011102001 |
4 | 32210130310322000131 |
5 | 112400440004323401 |
6 | 2043541110402301 |
7 | 132222641114440 |
oct | 16443464720035 |
9 | 3481263134361 |
10 | 1001211011101 |
11 | 35667a572514 |
12 | 14205b660391 |
13 | 7354c146b62 |
14 | 3665d201657 |
15 | 1b09cc29601 |
hex | e91cd3a01d |
1001211011101 has 8 divisors (see below), whose sum is σ = 1144263366144. Its totient is φ = 858164208720.
The previous prime is 1001211011093. The next prime is 1001211011113. The reversal of 1001211011101 is 1011101121001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1001211011101 - 23 = 1001211011093 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1001211911101) 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, 994330 + ... + 1729483.
It is an arithmetic number, because the mean of its divisors is an integer number (143032920768).
Almost surely, 21001211011101 is an apocalyptic number.
It is an amenable number.
1001211011101 is a deficient number, since it is larger than the sum of its proper divisors (143052355043).
1001211011101 is an equidigital number, since it uses as much as digits as its factorization.
1001211011101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2776331.
The product of its (nonzero) digits is 2, while the sum is 10.
Adding to 1001211011101 its reverse (1011101121001), we get a palindrome (2012312132102).
The spelling of 1001211011101 in words is "one trillion, one billion, two hundred eleven million, eleven thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •