Base | Representation |
---|---|
bin | 1001100111011101100… |
… | …00001001011011010111 |
3 | 1011120212202101022122001 |
4 | 10303232300021123113 |
5 | 20403201304112211 |
6 | 411443322020131 |
7 | 32605123060135 |
oct | 4635660113327 |
9 | 1146782338561 |
10 | 330423113431 |
11 | 11814a262754 |
12 | 54056047647 |
13 | 2520aa68888 |
14 | 11dc784a755 |
15 | 88dd514ac1 |
hex | 4ceec096d7 |
330423113431 has 2 divisors, whose sum is σ = 330423113432. Its totient is φ = 330423113430.
The previous prime is 330423113413. The next prime is 330423113507. The reversal of 330423113431 is 134311324033.
Together with previous prime (330423113413) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 330423113431 - 225 = 330389558999 is a prime.
It is a super-2 number, since 2×3304231134312 (a number of 24 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 330423113431.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (330423110431) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 165211556715 + 165211556716.
It is an arithmetic number, because the mean of its divisors is an integer number (165211556716).
Almost surely, 2330423113431 is an apocalyptic number.
330423113431 is a deficient number, since it is larger than the sum of its proper divisors (1).
330423113431 is an equidigital number, since it uses as much as digits as its factorization.
330423113431 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7776, while the sum is 28.
Adding to 330423113431 its reverse (134311324033), we get a palindrome (464734437464).
The spelling of 330423113431 in words is "three hundred thirty billion, four hundred twenty-three million, one hundred thirteen thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •