Base | Representation |
---|---|
bin | 10000000110001110110… |
… | …101101011110111010010 |
3 | 10220202022012011111101021 |
4 | 100012032311223313102 |
5 | 121111000434024132 |
6 | 2204103242030054 |
7 | 142630512431662 |
oct | 20061665536722 |
9 | 3822265144337 |
10 | 1106203033042 |
11 | 397157856588 |
12 | 15a4811a832a |
13 | 80411c50a23 |
14 | 3b77d2481a2 |
15 | 1db95341997 |
hex | 1018ed6bdd2 |
1106203033042 has 8 divisors (see below), whose sum is σ = 1659377718000. Its totient is φ = 553077127044.
The previous prime is 1106203033031. The next prime is 1106203033043. The reversal of 1106203033042 is 2403303026011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×11062030330422 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1106203032998 and 1106203033016.
It is not an unprimeable number, because it can be changed into a prime (1106203033043) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 12137992 + ... + 12228787.
It is an arithmetic number, because the mean of its divisors is an integer number (207422214750).
Almost surely, 21106203033042 is an apocalyptic number.
1106203033042 is a deficient number, since it is larger than the sum of its proper divisors (553174684958).
1106203033042 is a wasteful number, since it uses less digits than its factorization.
1106203033042 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24389480.
The product of its (nonzero) digits is 2592, while the sum is 25.
Adding to 1106203033042 its reverse (2403303026011), we get a palindrome (3509506059053).
The spelling of 1106203033042 in words is "one trillion, one hundred six billion, two hundred three million, thirty-three thousand, forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •