Base | Representation |
---|---|
bin | 10000000000101001110… |
… | …100010100111110011001 |
3 | 10220011211202021000021200 |
4 | 100000221310110332121 |
5 | 121011214040223113 |
6 | 2201233031224413 |
7 | 142326210664026 |
oct | 20005164247631 |
9 | 3804752230250 |
10 | 1100213211033 |
11 | 394663747662 |
12 | 15928b218109 |
13 | 7c999009851 |
14 | 3b37192854d |
15 | 1d944569873 |
hex | 10029d14f99 |
1100213211033 has 24 divisors (see below), whose sum is σ = 1642459742976. Its totient is φ = 708950253600.
The previous prime is 1100213211029. The next prime is 1100213211061. The reversal of 1100213211033 is 3301123120011.
It is not a de Polignac number, because 1100213211033 - 22 = 1100213211029 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1100213210997 and 1100213211015.
It is not an unprimeable number, because it can be changed into a prime (1100213221033) 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 23 ways as a sum of consecutive naturals, for example, 2172535 + ... + 2630652.
It is an arithmetic number, because the mean of its divisors is an integer number (68435822624).
Almost surely, 21100213211033 is an apocalyptic number.
It is an amenable number.
1100213211033 is a deficient number, since it is larger than the sum of its proper divisors (542246531943).
1100213211033 is a wasteful number, since it uses less digits than its factorization.
1100213211033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4804045 (or 4804042 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
Adding to 1100213211033 its reverse (3301123120011), we get a palindrome (4401336331044).
The spelling of 1100213211033 in words is "one trillion, one hundred billion, two hundred thirteen million, two hundred eleven thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •