Base | Representation |
---|---|
bin | 10000000001011110101… |
… | …100011011000000001101 |
3 | 10220021010120112101010112 |
4 | 100001132230123000031 |
5 | 121020023141043041 |
6 | 2201501041245405 |
7 | 142360202246465 |
oct | 20013654330015 |
9 | 3807116471115 |
10 | 1101100331021 |
11 | 394a79481a79 |
12 | 159498333865 |
13 | 7caaaa43812 |
14 | 3b417690ba5 |
15 | 1d99739edeb |
hex | 1005eb1b00d |
1101100331021 has 8 divisors (see below), whose sum is σ = 1112372649024. Its totient is φ = 1089854821440.
The previous prime is 1101100331017. The next prime is 1101100331047. The reversal of 1101100331021 is 1201330011011.
It is a happy number.
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 1101100331021 - 22 = 1101100331017 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1101100330987 and 1101100331005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1101100331011) 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, 6619535 + ... + 6783836.
It is an arithmetic number, because the mean of its divisors is an integer number (139046581128).
Almost surely, 21101100331021 is an apocalyptic number.
It is an amenable number.
1101100331021 is a deficient number, since it is larger than the sum of its proper divisors (11272318003).
1101100331021 is a wasteful number, since it uses less digits than its factorization.
1101100331021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13404211.
The product of its (nonzero) digits is 18, while the sum is 14.
Adding to 1101100331021 its reverse (1201330011011), we get a palindrome (2302430342032).
The spelling of 1101100331021 in words is "one trillion, one hundred one billion, one hundred million, three hundred thirty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •