Base | Representation |
---|---|
bin | 1001101110001010110… |
… | …01000010010101100001 |
3 | 1011221011201101021002001 |
4 | 10313011121002111201 |
5 | 20433040141002023 |
6 | 413240520524001 |
7 | 33063300325045 |
oct | 4670531022541 |
9 | 1157151337061 |
10 | 334024156513 |
11 | 119727a23713 |
12 | 548a0020601 |
13 | 25662b226b8 |
14 | 12249bcc025 |
15 | 8a4e7306ad |
hex | 4dc5642561 |
334024156513 has 2 divisors, whose sum is σ = 334024156514. Its totient is φ = 334024156512.
The previous prime is 334024156439. The next prime is 334024156517. The reversal of 334024156513 is 315651420433.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 310330327329 + 23693829184 = 557073^2 + 153928^2 .
It is a cyclic number.
It is not a de Polignac number, because 334024156513 - 233 = 325434221921 is a prime.
It is a super-2 number, since 2×3340241565132 (a number of 24 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (334024156517) 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, 167012078256 + 167012078257.
It is an arithmetic number, because the mean of its divisors is an integer number (167012078257).
Almost surely, 2334024156513 is an apocalyptic number.
It is an amenable number.
334024156513 is a deficient number, since it is larger than the sum of its proper divisors (1).
334024156513 is an equidigital number, since it uses as much as digits as its factorization.
334024156513 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 129600, while the sum is 37.
Adding to 334024156513 its reverse (315651420433), we get a palindrome (649675576946).
The spelling of 334024156513 in words is "three hundred thirty-four billion, twenty-four million, one hundred fifty-six thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •