Base | Representation |
---|---|
bin | 100101100010000001111000… |
… | …0101011101101101101111001 |
3 | 1121021220100102212120011220212 |
4 | 1023010003300223231231321 |
5 | 321232342130440343113 |
6 | 3130044422141400505 |
7 | 126352164506441465 |
oct | 11304036053555571 |
9 | 1537810385504825 |
10 | 330132404231033 |
11 | 96210403721aa8 |
12 | 31039a56269135 |
13 | 112294768562b1 |
14 | 5b746ca6cd4a5 |
15 | 282777c5ab0a8 |
hex | 12c40f0aedb79 |
330132404231033 has 2 divisors, whose sum is σ = 330132404231034. Its totient is φ = 330132404231032.
The previous prime is 330132404231029. The next prime is 330132404231057.
330132404231033 is nontrivially palindromic in base 10.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 320990652428944 + 9141751802089 = 17916212^2 + 3023533^2 .
It is a palprime.
It is a cyclic number.
It is not a de Polignac number, because 330132404231033 - 22 = 330132404231029 is a prime.
It is not a weakly prime, because it can be changed into another prime (330132404291033) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 165066202115516 + 165066202115517.
It is an arithmetic number, because the mean of its divisors is an integer number (165066202115517).
Almost surely, 2330132404231033 is an apocalyptic number.
It is an amenable number.
330132404231033 is a deficient number, since it is larger than the sum of its proper divisors (1).
330132404231033 is an equidigital number, since it uses as much as digits as its factorization.
330132404231033 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 46656, while the sum is 32.
It can be divided in two parts, 33013240 and 4231033, that added together give a palindrome (37244273).
The spelling of 330132404231033 in words is "three hundred thirty trillion, one hundred thirty-two billion, four hundred four million, two hundred thirty-one thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •