Base | Representation |
---|---|
bin | 10011110000001… |
… | …100010100110101 |
3 | 212002120220000122 |
4 | 103300030110311 |
5 | 1134314304001 |
6 | 52515021325 |
7 | 11132600135 |
oct | 2360142465 |
9 | 762526018 |
10 | 331400501 |
11 | 160081113 |
12 | 92b9a845 |
13 | 53873393 |
14 | 32028ac5 |
15 | 1e162b1b |
hex | 13c0c535 |
331400501 has 2 divisors, whose sum is σ = 331400502. Its totient is φ = 331400500.
The previous prime is 331400483. The next prime is 331400521. The reversal of 331400501 is 105004133.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 201668401 + 129732100 = 14201^2 + 11390^2 .
It is a cyclic number.
It is not a de Polignac number, because 331400501 - 222 = 327206197 is a prime.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 331400501.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (331400521) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 165700250 + 165700251.
It is an arithmetic number, because the mean of its divisors is an integer number (165700251).
Almost surely, 2331400501 is an apocalyptic number.
It is an amenable number.
331400501 is a deficient number, since it is larger than the sum of its proper divisors (1).
331400501 is an equidigital number, since it uses as much as digits as its factorization.
331400501 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 180, while the sum is 17.
The square root of 331400501 is about 18204.4088341259. The cubic root of 331400501 is about 692.0185245968.
Adding to 331400501 its reverse (105004133), we get a palindrome (436404634).
The spelling of 331400501 in words is "three hundred thirty-one million, four hundred thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •