Base | Representation |
---|---|
bin | 100101100010000001101100… |
… | …1110011001000100110101001 |
3 | 1121021220022110010010110211102 |
4 | 1023010003121303020212221 |
5 | 321232340334144101301 |
6 | 3130044320104411145 |
7 | 126352152135204560 |
oct | 11304033163104651 |
9 | 1537808403113742 |
10 | 330132020300201 |
11 | 96210226a32099 |
12 | 31039969776ab5 |
13 | 1122941514cba2 |
14 | 5b7469170cbd7 |
15 | 2827758a1db6b |
hex | 12c40d9cc89a9 |
330132020300201 has 4 divisors (see below), whose sum is σ = 377293737485952. Its totient is φ = 282970303114452.
The previous prime is 330132020300191. The next prime is 330132020300219. The reversal of 330132020300201 is 102003020231033.
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 330132020300201 - 238 = 329857142393257 is a prime.
It is not an unprimeable number, because it can be changed into a prime (330132020303201) 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, 23580858592865 + ... + 23580858592878.
It is an arithmetic number, because the mean of its divisors is an integer number (94323434371488).
Almost surely, 2330132020300201 is an apocalyptic number.
It is an amenable number.
330132020300201 is a deficient number, since it is larger than the sum of its proper divisors (47161717185751).
330132020300201 is an equidigital number, since it uses as much as digits as its factorization.
330132020300201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47161717185750.
The product of its (nonzero) digits is 648, while the sum is 20.
Adding to 330132020300201 its reverse (102003020231033), we get a palindrome (432135040531234).
The spelling of 330132020300201 in words is "three hundred thirty trillion, one hundred thirty-two billion, twenty million, three hundred thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •