Base | Representation |
---|---|
bin | 10000101000101110000… |
… | …000100110111010000001 |
3 | 11001021212212222111100001 |
4 | 100220232000212322001 |
5 | 122212320200241113 |
6 | 2233105531200001 |
7 | 145411245652333 |
oct | 20505600467201 |
9 | 4037785874301 |
10 | 1143233212033 |
11 | 40092a3870a0 |
12 | 1656965a6001 |
13 | 83a63957343 |
14 | 3d493227453 |
15 | 1eb112467dd |
hex | 10a2e026e81 |
1143233212033 has 4 divisors (see below), whose sum is σ = 1247163504048. Its totient is φ = 1039302920020.
The previous prime is 1143233211943. The next prime is 1143233212063. The reversal of 1143233212033 is 3302123323411.
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 1143233212033 - 225 = 1143199657601 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1143233211992 and 1143233212010.
It is not an unprimeable number, because it can be changed into a prime (1143233212063) 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, 51965145991 + ... + 51965146012.
It is an arithmetic number, because the mean of its divisors is an integer number (311790876012).
Almost surely, 21143233212033 is an apocalyptic number.
It is an amenable number.
1143233212033 is a deficient number, since it is larger than the sum of its proper divisors (103930292015).
1143233212033 is a wasteful number, since it uses less digits than its factorization.
1143233212033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 103930292014.
The product of its (nonzero) digits is 7776, while the sum is 28.
Adding to 1143233212033 its reverse (3302123323411), we get a palindrome (4445356535444).
The spelling of 1143233212033 in words is "one trillion, one hundred forty-three billion, two hundred thirty-three million, two hundred twelve thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •