Base | Representation |
---|---|
bin | 100101101100111100101010… |
… | …1100011110100010101111111 |
3 | 1121111012210211202222020100121 |
4 | 1023121321111203310111333 |
5 | 321431433431300334033 |
6 | 3133154040535235411 |
7 | 126565460615216506 |
oct | 11331712543642577 |
9 | 1544183752866317 |
10 | 331633040246143 |
11 | 96739867621a09 |
12 | 31240856218b67 |
13 | 11307b279682ac |
14 | 5bc71a65d983d |
15 | 285180a6d962d |
hex | 12d9e558f457f |
331633040246143 has 2 divisors, whose sum is σ = 331633040246144. Its totient is φ = 331633040246142.
The previous prime is 331633040246141. The next prime is 331633040246191. The reversal of 331633040246143 is 341642040336133.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 331633040246143 - 21 = 331633040246141 is a prime.
Together with 331633040246141, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 331633040246143.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (331633040246141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 165816520123071 + 165816520123072.
It is an arithmetic number, because the mean of its divisors is an integer number (165816520123072).
Almost surely, 2331633040246143 is an apocalyptic number.
331633040246143 is a deficient number, since it is larger than the sum of its proper divisors (1).
331633040246143 is an equidigital number, since it uses as much as digits as its factorization.
331633040246143 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1119744, while the sum is 43.
The spelling of 331633040246143 in words is "three hundred thirty-one trillion, six hundred thirty-three billion, forty million, two hundred forty-six thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •