Base | Representation |
---|---|
bin | 100110000001010000100000… |
… | …0111001010110100001000011 |
3 | 1121212002122212222210102010101 |
4 | 1030002201000321112201003 |
5 | 322313202204102441003 |
6 | 3143132243024343231 |
7 | 130304236641254302 |
oct | 11402410071264103 |
9 | 1555078788712111 |
10 | 334424422312003 |
11 | 97615667a71a71 |
12 | 3161183a474b17 |
13 | 1147b11a8cb2ca |
14 | 5c8232aa52439 |
15 | 289e2300ec11d |
hex | 1302840e56843 |
334424422312003 has 2 divisors, whose sum is σ = 334424422312004. Its totient is φ = 334424422312002.
The previous prime is 334424422311937. The next prime is 334424422312027. The reversal of 334424422312003 is 300213224424433.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-334424422312003 is a prime.
It is a super-2 number, since 2×3344244223120032 (a number of 30 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (334424422012003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 167212211156001 + 167212211156002.
It is an arithmetic number, because the mean of its divisors is an integer number (167212211156002).
Almost surely, 2334424422312003 is an apocalyptic number.
334424422312003 is a deficient number, since it is larger than the sum of its proper divisors (1).
334424422312003 is an equidigital number, since it uses as much as digits as its factorization.
334424422312003 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 331776, while the sum is 37.
Adding to 334424422312003 its reverse (300213224424433), we get a palindrome (634637646736436).
The spelling of 334424422312003 in words is "three hundred thirty-four trillion, four hundred twenty-four billion, four hundred twenty-two million, three hundred twelve thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •