Base | Representation |
---|---|
bin | 1001010001010011000001… |
… | …01100001110001110010011 |
3 | 2200011211122010022221201001 |
4 | 10220221200230032032103 |
5 | 10132444034432222042 |
6 | 111204553021522431 |
7 | 4202543416260145 |
oct | 450514054161623 |
9 | 80154563287631 |
10 | 20385536992147 |
11 | 654a504200588 |
12 | 2352a2b113417 |
13 | b4b46a410862 |
14 | 506945660c95 |
15 | 25541bb8dbb7 |
hex | 128a60b0e393 |
20385536992147 has 2 divisors, whose sum is σ = 20385536992148. Its totient is φ = 20385536992146.
The previous prime is 20385536992129. The next prime is 20385536992157. The reversal of 20385536992147 is 74129963558302.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 20385536992147 - 211 = 20385536990099 is a prime.
It is not a weakly prime, because it can be changed into another prime (20385536992157) 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 as a sum of consecutive naturals, namely, 10192768496073 + 10192768496074.
It is an arithmetic number, because the mean of its divisors is an integer number (10192768496074).
It is a 1-persistent number, because it is pandigital, but 2⋅20385536992147 = 40771073984294 is not.
Almost surely, 220385536992147 is an apocalyptic number.
20385536992147 is a deficient number, since it is larger than the sum of its proper divisors (1).
20385536992147 is an equidigital number, since it uses as much as digits as its factorization.
20385536992147 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 97977600, while the sum is 64.
The spelling of 20385536992147 in words is "twenty trillion, three hundred eighty-five billion, five hundred thirty-six million, nine hundred ninety-two thousand, one hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •