Base | Representation |
---|---|
bin | 10000000010101110000… |
… | …010001011001001011111 |
3 | 10220101120100020101012100 |
4 | 100002232002023021133 |
5 | 121030234421331221 |
6 | 2202241111340143 |
7 | 142435164366255 |
oct | 20025602131137 |
9 | 3811510211170 |
10 | 1102431433311 |
11 | 3955a189290a |
12 | 1597aa081653 |
13 | 7cc6074b400 |
14 | 3b50238a5d5 |
15 | 1da24185926 |
hex | 100ae08b25f |
1102431433311 has 72 divisors (see below), whose sum is σ = 1736268348672. Its totient is φ = 673729056000.
The previous prime is 1102431433283. The next prime is 1102431433333. The reversal of 1102431433311 is 1133341342011.
1102431433311 is a `hidden beast` number, since 1 + 1 + 0 + 2 + 4 + 314 + 33 + 311 = 666.
It is not a de Polignac number, because 1102431433311 - 211 = 1102431431263 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1102431433381) 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 71 ways as a sum of consecutive naturals, for example, 192024901 + ... + 192030641.
It is an arithmetic number, because the mean of its divisors is an integer number (24114838176).
Almost surely, 21102431433311 is an apocalyptic number.
1102431433311 is a deficient number, since it is larger than the sum of its proper divisors (633836915361).
1102431433311 is a wasteful number, since it uses less digits than its factorization.
1102431433311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6625 (or 6609 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 27.
Adding to 1102431433311 its reverse (1133341342011), we get a palindrome (2235772775322).
The spelling of 1102431433311 in words is "one trillion, one hundred two billion, four hundred thirty-one million, four hundred thirty-three thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •