Base | Representation |
---|---|
bin | 10011010110110110000… |
… | …111100100101101001101 |
3 | 11201011110221121022222221 |
4 | 103112312013210231031 |
5 | 133243222241130013 |
6 | 2455030253335341 |
7 | 165050414163010 |
oct | 23266607445515 |
9 | 4634427538887 |
10 | 1330200333133 |
11 | 4731534564a1 |
12 | 195975497551 |
13 | 9858bb32349 |
14 | 4854c461377 |
15 | 2490542208d |
hex | 135b61e4b4d |
1330200333133 has 8 divisors (see below), whose sum is σ = 1520236757952. Its totient is φ = 1140165859776.
The previous prime is 1330200333127. The next prime is 1330200333193. The reversal of 1330200333133 is 3313330020331.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1330200333133 - 29 = 1330200332621 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1330200333098 and 1330200333107.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1330200333193) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1528266 + ... + 2235172.
It is an arithmetic number, because the mean of its divisors is an integer number (190029594744).
Almost surely, 21330200333133 is an apocalyptic number.
It is an amenable number.
1330200333133 is a deficient number, since it is larger than the sum of its proper divisors (190036424819).
1330200333133 is an equidigital number, since it uses as much as digits as its factorization.
1330200333133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 975731.
The product of its (nonzero) digits is 4374, while the sum is 25.
Adding to 1330200333133 its reverse (3313330020331), we get a palindrome (4643530353464).
The spelling of 1330200333133 in words is "one trillion, three hundred thirty billion, two hundred million, three hundred thirty-three thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •