Base | Representation |
---|---|
bin | 10010101011111100… |
… | …000111010011011001 |
3 | 1220210022221211001201 |
4 | 102223330013103121 |
5 | 312043010003143 |
6 | 13114552314201 |
7 | 1310134463614 |
oct | 225374072331 |
9 | 56708854051 |
10 | 20064531673 |
11 | 85669a568a |
12 | 3a7b6a2961 |
13 | 1b79b80464 |
14 | d84ac317b |
15 | 7c676664d |
hex | 4abf074d9 |
20064531673 has 4 divisors (see below), whose sum is σ = 21244798260. Its totient is φ = 18884265088.
The previous prime is 20064531671. The next prime is 20064531679. The reversal of 20064531673 is 37613546002.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 37613546002 = 2 ⋅18806773001.
It can be written as a sum of positive squares in 2 ways, for example, as 15693073984 + 4371457689 = 125272^2 + 66117^2 .
It is a cyclic number.
It is not a de Polignac number, because 20064531673 - 21 = 20064531671 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20064531671) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 590133268 + ... + 590133301.
It is an arithmetic number, because the mean of its divisors is an integer number (5311199565).
Almost surely, 220064531673 is an apocalyptic number.
It is an amenable number.
20064531673 is a deficient number, since it is larger than the sum of its proper divisors (1180266587).
20064531673 is a wasteful number, since it uses less digits than its factorization.
20064531673 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1180266586.
The product of its (nonzero) digits is 90720, while the sum is 37.
The spelling of 20064531673 in words is "twenty billion, sixty-four million, five hundred thirty-one thousand, six hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •