Base | Representation |
---|---|
bin | 10000000011011100101… |
… | …000000111000100110001 |
3 | 10220110120211010200111210 |
4 | 100003130220013010301 |
5 | 121033340030130113 |
6 | 2202450434030333 |
7 | 142463435611410 |
oct | 20033450070461 |
9 | 3813524120453 |
10 | 1103213130033 |
11 | 395963062163 |
12 | 159987a183a9 |
13 | 80056693251 |
14 | 3b57810d477 |
15 | 1da6cae46c3 |
hex | 100dca07131 |
1103213130033 has 16 divisors (see below), whose sum is σ = 1681370496000. Its totient is φ = 630301069776.
The previous prime is 1103213130007. The next prime is 1103213130043. The reversal of 1103213130033 is 3300313123011.
It is not a de Polignac number, because 1103213130033 - 26 = 1103213129969 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1103213129991 and 1103213130009.
It is not an unprimeable number, because it can be changed into a prime (1103213130043) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4307283 + ... + 4556216.
It is an arithmetic number, because the mean of its divisors is an integer number (105085656000).
Almost surely, 21103213130033 is an apocalyptic number.
It is an amenable number.
1103213130033 is a deficient number, since it is larger than the sum of its proper divisors (578157365967).
1103213130033 is an equidigital number, since it uses as much as digits as its factorization.
1103213130033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8869436.
The product of its (nonzero) digits is 486, while the sum is 21.
Adding to 1103213130033 its reverse (3300313123011), we get a palindrome (4403526253044).
The spelling of 1103213130033 in words is "one trillion, one hundred three billion, two hundred thirteen million, one hundred thirty thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •