Base | Representation |
---|---|
bin | 101111000101000001… |
… | …1001001110000100101 |
3 | 100122221212002220021110 |
4 | 1132022003021300211 |
5 | 3124023141030041 |
6 | 114240030535233 |
7 | 10206234424515 |
oct | 1361203116045 |
9 | 318855086243 |
10 | 101100330021 |
11 | 39970556359 |
12 | 17716367519 |
13 | 96c27776b2 |
14 | 4c71247845 |
15 | 296ab38516 |
hex | 178a0c9c25 |
101100330021 has 8 divisors (see below), whose sum is σ = 134830743264. Its totient is φ = 67385068400.
The previous prime is 101100330013. The next prime is 101100330031. The reversal of 101100330021 is 120033001101.
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 101100330021 - 23 = 101100330013 is a prime.
It is a super-2 number, since 2×1011003300212 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 101100329979 and 101100330006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101100330011) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3772326 + ... + 3799031.
It is an arithmetic number, because the mean of its divisors is an integer number (16853842908).
Almost surely, 2101100330021 is an apocalyptic number.
It is an amenable number.
101100330021 is a deficient number, since it is larger than the sum of its proper divisors (33730413243).
101100330021 is an equidigital number, since it uses as much as digits as its factorization.
101100330021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7575811.
The product of its (nonzero) digits is 18, while the sum is 12.
Adding to 101100330021 its reverse (120033001101), we get a palindrome (221133331122).
The spelling of 101100330021 in words is "one hundred one billion, one hundred million, three hundred thirty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •