Base | Representation |
---|---|
bin | 10110111111001100110011… |
… | …100111101001001101111001 |
3 | 111020222002000212211100102001 |
4 | 112333030303213221031321 |
5 | 101222411001402223001 |
6 | 555004424553341001 |
7 | 30203145520144504 |
oct | 2677146347511571 |
9 | 436862025740361 |
10 | 101100101211001 |
11 | 2a239348506522 |
12 | b409a63407761 |
13 | 4454910b99c89 |
14 | 1ad73b190413b |
15 | ba4ca40b4001 |
hex | 5bf3339e9379 |
101100101211001 has 8 divisors (see below), whose sum is σ = 101896521606144. Its totient is φ = 100303686388080.
The previous prime is 101100101210971. The next prime is 101100101211007. The reversal of 101100101211001 is 100112101001101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-101100101211001 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (101100101211007) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 39820491 + ... + 42283231.
It is an arithmetic number, because the mean of its divisors is an integer number (12737065200768).
Almost surely, 2101100101211001 is an apocalyptic number.
It is an amenable number.
101100101211001 is a deficient number, since it is larger than the sum of its proper divisors (796420395143).
101100101211001 is a wasteful number, since it uses less digits than its factorization.
101100101211001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2786111.
The product of its (nonzero) digits is 2, while the sum is 10.
Adding to 101100101211001 its reverse (100112101001101), we get a palindrome (201212202212102).
The spelling of 101100101211001 in words is "one hundred one trillion, one hundred billion, one hundred one million, two hundred eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •