Base | Representation |
---|---|
bin | 100101101010001000001000… |
… | …1000010010000101101110101 |
3 | 1121102211202010112020001121001 |
4 | 1023110100101002100231311 |
5 | 321404110430421322013 |
6 | 3132300002101323301 |
7 | 126525454256500216 |
oct | 11324202102205565 |
9 | 1542752115201531 |
10 | 331245343542133 |
11 | 965aa3a7976a29 |
12 | 31199697406531 |
13 | 112aa3c0274867 |
14 | 5bb250844540d |
15 | 28466b8ec1ddd |
hex | 12d4411090b75 |
331245343542133 has 2 divisors, whose sum is σ = 331245343542134. Its totient is φ = 331245343542132.
The previous prime is 331245343542041. The next prime is 331245343542149.
331245343542133 is nontrivially palindromic in base 10.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 330358324280644 + 887019261489 = 18175762^2 + 941817^2 .
It is a palprime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-331245343542133 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (331245343542733) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 165622671771066 + 165622671771067.
It is an arithmetic number, because the mean of its divisors is an integer number (165622671771067).
Almost surely, 2331245343542133 is an apocalyptic number.
It is an amenable number.
331245343542133 is a deficient number, since it is larger than the sum of its proper divisors (1).
331245343542133 is an equidigital number, since it uses as much as digits as its factorization.
331245343542133 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 4665600, while the sum is 46.
The spelling of 331245343542133 in words is "three hundred thirty-one trillion, two hundred forty-five billion, three hundred forty-three million, five hundred forty-two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •