Base | Representation |
---|---|
bin | 10000000011010001001… |
… | …111100000011110111101 |
3 | 10220110002111201221021110 |
4 | 100003101033200132331 |
5 | 121032442131144013 |
6 | 2202415452152233 |
7 | 142455626263326 |
oct | 20032117403675 |
9 | 3813074657243 |
10 | 1103022131133 |
11 | 39587526792a |
12 | 159933a68679 |
13 | 80025c3ac50 |
14 | 3b55a9d144d |
15 | 1da5ae672c3 |
hex | 100d13e07bd |
1103022131133 has 16 divisors (see below), whose sum is σ = 1584516298176. Its totient is φ = 678487286400.
The previous prime is 1103022131093. The next prime is 1103022131143. The reversal of 1103022131133 is 3311312203011.
It is a happy number.
It is not a de Polignac number, because 1103022131133 - 26 = 1103022131069 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1103022131143) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 6066843 + ... + 6246008.
It is an arithmetic number, because the mean of its divisors is an integer number (99032268636).
Almost surely, 21103022131133 is an apocalyptic number.
1103022131133 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
1103022131133 is a deficient number, since it is larger than the sum of its proper divisors (481494167043).
1103022131133 is a wasteful number, since it uses less digits than its factorization.
1103022131133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12315164.
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 1103022131133 its reverse (3311312203011), we get a palindrome (4414334334144).
The spelling of 1103022131133 in words is "one trillion, one hundred three billion, twenty-two million, one hundred thirty-one thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •