Base | Representation |
---|---|
bin | 10000000000101001110… |
… | …011111010001001001101 |
3 | 10220011211202001102112022 |
4 | 100000221303322021031 |
5 | 121011214023214013 |
6 | 2201233025015525 |
7 | 142326210025436 |
oct | 20005163721115 |
9 | 3804752042468 |
10 | 1100213101133 |
11 | 394663682033 |
12 | 15928b1845a5 |
13 | 7c998c9b813 |
14 | 3b3718da48d |
15 | 1d944547008 |
hex | 10029cfa24d |
1100213101133 has 8 divisors (see below), whose sum is σ = 1102576039680. Its totient is φ = 1097850438720.
The previous prime is 1100213101109. The next prime is 1100213101139. The reversal of 1100213101133 is 3311013120011.
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 1100213101133 - 210 = 1100213100109 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 (1100213101139) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 9253166 + ... + 9371312.
It is an arithmetic number, because the mean of its divisors is an integer number (137822004960).
Almost surely, 21100213101133 is an apocalyptic number.
It is an amenable number.
1100213101133 is a deficient number, since it is larger than the sum of its proper divisors (2362938547).
1100213101133 is a wasteful number, since it uses less digits than its factorization.
1100213101133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 138067.
The product of its (nonzero) digits is 54, while the sum is 17.
Adding to 1100213101133 its reverse (3311013120011), we get a palindrome (4411226221144).
The spelling of 1100213101133 in words is "one trillion, one hundred billion, two hundred thirteen million, one hundred one thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •