Base | Representation |
---|---|
bin | 10011010110110110101… |
… | …100100100111010010101 |
3 | 11201011111121212011010102 |
4 | 103112312230210322111 |
5 | 133243232232031201 |
6 | 2455031241303445 |
7 | 165050562503252 |
oct | 23266654447225 |
9 | 4634447764112 |
10 | 1330210033301 |
11 | 473158981366 |
12 | 195978794b85 |
13 | 98590b4a5a6 |
14 | 4854d868429 |
15 | 249061db26b |
hex | 135b6b24e95 |
1330210033301 has 8 divisors (see below), whose sum is σ = 1338459549240. Its totient is φ = 1321966959552.
The previous prime is 1330210033219. The next prime is 1330210033307. The reversal of 1330210033301 is 1033300120331.
It can be written as a sum of positive squares in 4 ways, for example, as 364422298276 + 965787735025 = 603674^2 + 982745^2 .
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 1330210033301 - 226 = 1330142924437 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1330210033307) 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, 1195970 + ... + 2022563.
It is an arithmetic number, because the mean of its divisors is an integer number (167307443655).
Almost surely, 21330210033301 is an apocalyptic number.
It is an amenable number.
1330210033301 is a deficient number, since it is larger than the sum of its proper divisors (8249515939).
1330210033301 is a wasteful number, since it uses less digits than its factorization.
1330210033301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3221095.
The product of its (nonzero) digits is 486, while the sum is 20.
Adding to 1330210033301 its reverse (1033300120331), we get a palindrome (2363510153632).
The spelling of 1330210033301 in words is "one trillion, three hundred thirty billion, two hundred ten million, thirty-three thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •