Base | Representation |
---|---|
bin | 10010101011111011… |
… | …010010110011111111 |
3 | 1220210022112220010200 |
4 | 102223323102303333 |
5 | 312042431113141 |
6 | 13114543534543 |
7 | 1310132610030 |
oct | 225373226377 |
9 | 56708486120 |
10 | 20064316671 |
11 | 85668690a3 |
12 | 3a7b5ba453 |
13 | 1b79b06639 |
14 | d84a68a87 |
15 | 7c6722ab6 |
hex | 4abed2cff |
20064316671 has 48 divisors (see below), whose sum is σ = 33655025664. Its totient is φ = 11281228992.
The previous prime is 20064316667. The next prime is 20064316693. The reversal of 20064316671 is 17661346002.
It is a happy number.
20064316671 is a `hidden beast` number, since 2 + 0 + 0 + 643 + 1 + 6 + 6 + 7 + 1 = 666.
It is not a de Polignac number, because 20064316671 - 22 = 20064316667 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20064316661) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 4586041 + ... + 4590413.
It is an arithmetic number, because the mean of its divisors is an integer number (701146368).
Almost surely, 220064316671 is an apocalyptic number.
20064316671 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
20064316671 is a deficient number, since it is larger than the sum of its proper divisors (13590708993).
20064316671 is a wasteful number, since it uses less digits than its factorization.
20064316671 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5540 (or 5537 counting only the distinct ones).
The product of its (nonzero) digits is 36288, while the sum is 36.
It can be divided in two parts, 2006431 and 6671, that added together give a palindrome (2013102).
The spelling of 20064316671 in words is "twenty billion, sixty-four million, three hundred sixteen thousand, six hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •