Base | Representation |
---|---|
bin | 10000100110111100100… |
… | …101001100100111001001 |
3 | 11001002222021010112000011 |
4 | 100212330211030213021 |
5 | 122144421012413113 |
6 | 2232153031111521 |
7 | 145313140432321 |
oct | 20467445144711 |
9 | 4032867115004 |
10 | 1141330201033 |
11 | 400043164830 |
12 | 1652452125a1 |
13 | 8381c60b129 |
14 | 3d3525b8281 |
15 | 1ea4e14163d |
hex | 109bc94c9c9 |
1141330201033 has 16 divisors (see below), whose sum is σ = 1324084872960. Its totient is φ = 972274809600.
The previous prime is 1141330201031. The next prime is 1141330201043. The reversal of 1141330201033 is 3301020331411.
It is a cyclic number.
It is not a de Polignac number, because 1141330201033 - 21 = 1141330201031 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1141330200995 and 1141330201013.
It is not an unprimeable number, because it can be changed into a prime (1141330201031) 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, 13283313 + ... + 13368958.
It is an arithmetic number, because the mean of its divisors is an integer number (82755304560).
Almost surely, 21141330201033 is an apocalyptic number.
It is an amenable number.
1141330201033 is a deficient number, since it is larger than the sum of its proper divisors (182754671927).
1141330201033 is a wasteful number, since it uses less digits than its factorization.
1141330201033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26652528.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 1141330201033 its reverse (3301020331411), we get a palindrome (4442350532444).
The spelling of 1141330201033 in words is "one trillion, one hundred forty-one billion, three hundred thirty million, two hundred one thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •