Base | Representation |
---|---|
bin | 10011000001111111… |
… | …001011100100001001 |
3 | 1221202002222211002111 |
4 | 103001333023210021 |
5 | 313322203344223 |
6 | 13215404502321 |
7 | 1322245553146 |
oct | 230177134411 |
9 | 57662884074 |
10 | 20434434313 |
11 | 8736783a47 |
12 | 3b6354a9a1 |
13 | 1c086b4667 |
14 | dbbc913cd |
15 | 7e8e8230d |
hex | 4c1fcb909 |
20434434313 has 2 divisors, whose sum is σ = 20434434314. Its totient is φ = 20434434312.
The previous prime is 20434434311. The next prime is 20434434359. The reversal of 20434434313 is 31343443402.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11150726409 + 9283707904 = 105597^2 + 96352^2 .
It is a cyclic number.
It is not a de Polignac number, because 20434434313 - 21 = 20434434311 is a prime.
It is a super-2 number, since 2×204344343132 (a number of 21 digits) contains 22 as substring.
Together with 20434434311, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (20434434311) 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, 10217217156 + 10217217157.
It is an arithmetic number, because the mean of its divisors is an integer number (10217217157).
Almost surely, 220434434313 is an apocalyptic number.
It is an amenable number.
20434434313 is a deficient number, since it is larger than the sum of its proper divisors (1).
20434434313 is an equidigital number, since it uses as much as digits as its factorization.
20434434313 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 41472, while the sum is 31.
Adding to 20434434313 its reverse (31343443402), we get a palindrome (51777877715).
The spelling of 20434434313 in words is "twenty billion, four hundred thirty-four million, four hundred thirty-four thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •