Base | Representation |
---|---|
bin | 10000000001011110101… |
… | …011100010111001101111 |
3 | 10220021010120002200220210 |
4 | 100001132223202321233 |
5 | 121020023111214411 |
6 | 2201501032313503 |
7 | 142360200301524 |
oct | 20013653427157 |
9 | 3807116080823 |
10 | 1101100101231 |
11 | 394a79335369 |
12 | 159498242893 |
13 | 7caaa993050 |
14 | 3b41763114b |
15 | 1d997356ca6 |
hex | 1005eae2e6f |
1101100101231 has 8 divisors (see below), whose sum is σ = 1581066812080. Its totient is φ = 677600062272.
The previous prime is 1101100101229. The next prime is 1101100101293. The reversal of 1101100101231 is 1321010011011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1101100101231 - 21 = 1101100101229 is a prime.
It is a super-3 number, since 3×11011001012313 (a number of 37 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1101100101331) 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, 14116667926 + ... + 14116668003.
It is an arithmetic number, because the mean of its divisors is an integer number (197633351510).
Almost surely, 21101100101231 is an apocalyptic number.
1101100101231 is a deficient number, since it is larger than the sum of its proper divisors (479966710849).
1101100101231 is a wasteful number, since it uses less digits than its factorization.
1101100101231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28233335945.
The product of its (nonzero) digits is 6, while the sum is 12.
Adding to 1101100101231 its reverse (1321010011011), we get a palindrome (2422110112242).
The spelling of 1101100101231 in words is "one trillion, one hundred one billion, one hundred million, one hundred one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •