Base | Representation |
---|---|
bin | 1001100001010011100110… |
… | …00010010010101000011011 |
3 | 2202010102110000000111021120 |
4 | 10300221303002102220123 |
5 | 10221002102222044042 |
6 | 112305403201340323 |
7 | 4260355461525120 |
oct | 460516302225033 |
9 | 82112400014246 |
10 | 20935600581147 |
11 | 674181381341a |
12 | 24215623376a3 |
13 | b8b2ac533a75 |
14 | 525407808747 |
15 | 2648b2a27dec |
hex | 130a73092a1b |
20935600581147 has 64 divisors (see below), whose sum is σ = 32511365038080. Its totient is φ = 11736600655104.
The previous prime is 20935600581109. The next prime is 20935600581169. The reversal of 20935600581147 is 74118500653902.
It is not a de Polignac number, because 20935600581147 - 214 = 20935600564763 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 20935600581147.
It is not an unprimeable number, because it can be changed into a prime (20935600589147) 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 63 ways as a sum of consecutive naturals, for example, 2030015263 + ... + 2030025575.
It is an arithmetic number, because the mean of its divisors is an integer number (507990078720).
It is a 1-persistent number, because it is pandigital, but 2⋅20935600581147 = 41871201162294 is not.
Almost surely, 220935600581147 is an apocalyptic number.
20935600581147 is a deficient number, since it is larger than the sum of its proper divisors (11575764456933).
20935600581147 is a wasteful number, since it uses less digits than its factorization.
20935600581147 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18072.
The product of its (nonzero) digits is 1814400, while the sum is 51.
The spelling of 20935600581147 in words is "twenty trillion, nine hundred thirty-five billion, six hundred million, five hundred eighty-one thousand, one hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •