Base | Representation |
---|---|
bin | 10011011000101101111… |
… | …110000101110001001001 |
3 | 11201100200002020112110120 |
4 | 103120231332011301021 |
5 | 133311332021104113 |
6 | 2500002003333453 |
7 | 165151301423043 |
oct | 23305576056111 |
9 | 4640602215416 |
10 | 1332211113033 |
11 | 473a95496169 |
12 | 196236981289 |
13 | 9881c5b2238 |
14 | 4869d524a93 |
15 | 249c1c13a23 |
hex | 1362df85c49 |
1332211113033 has 4 divisors (see below), whose sum is σ = 1776281484048. Its totient is φ = 888140742020.
The previous prime is 1332211113017. The next prime is 1332211113071. The reversal of 1332211113033 is 3303111122331.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1332211113033 - 24 = 1332211113017 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1332211112994 and 1332211113012.
It is not an unprimeable number, because it can be changed into a prime (1332211113073) 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, 222035185503 + ... + 222035185508.
It is an arithmetic number, because the mean of its divisors is an integer number (444070371012).
Almost surely, 21332211113033 is an apocalyptic number.
It is an amenable number.
1332211113033 is a deficient number, since it is larger than the sum of its proper divisors (444070371015).
1332211113033 is an equidigital number, since it uses as much as digits as its factorization.
1332211113033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 444070371014.
The product of its (nonzero) digits is 972, while the sum is 24.
Adding to 1332211113033 its reverse (3303111122331), we get a palindrome (4635322235364).
The spelling of 1332211113033 in words is "one trillion, three hundred thirty-two billion, two hundred eleven million, one hundred thirteen thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •