Base | Representation |
---|---|
bin | 100101100010000010010000… |
… | …0101101111110111000100011 |
3 | 1121021220102112001000012012221 |
4 | 1023010010200231332320203 |
5 | 321232400303243211003 |
6 | 3130045034130531511 |
7 | 126352223463463135 |
oct | 11304044055767043 |
9 | 1537812461005187 |
10 | 330133210132003 |
11 | 96210787623363 |
12 | 3103a040136b97 |
13 | 112295747c4085 |
14 | 5b74765753055 |
15 | 28277c81eb7bd |
hex | 12c4120b7ee23 |
330133210132003 has 8 divisors (see below), whose sum is σ = 331244760870288. Its totient is φ = 329022100407264.
The previous prime is 330133210131913. The next prime is 330133210132007. The reversal of 330133210132003 is 300231012331033.
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 330133210132003 - 213 = 330133210123811 is a prime.
It is a super-2 number, since 2×3301332101320032 (a number of 30 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (330133210132007) 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, 108753676 + ... + 111748057.
It is an arithmetic number, because the mean of its divisors is an integer number (41405595108786).
Almost surely, 2330133210132003 is an apocalyptic number.
330133210132003 is a deficient number, since it is larger than the sum of its proper divisors (1111550738285).
330133210132003 is a wasteful number, since it uses less digits than its factorization.
330133210132003 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 220506773.
The product of its (nonzero) digits is 2916, while the sum is 25.
Adding to 330133210132003 its reverse (300231012331033), we get a palindrome (630364222463036).
The spelling of 330133210132003 in words is "three hundred thirty trillion, one hundred thirty-three billion, two hundred ten million, one hundred thirty-two thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •