Base | Representation |
---|---|
bin | 1001010000001010010101… |
… | …01011111001000101101101 |
3 | 2200001002220110222220001102 |
4 | 10220011022223321011231 |
5 | 10131324124323214130 |
6 | 111135020432252445 |
7 | 4166662363544216 |
oct | 450051253710555 |
9 | 80032813886042 |
10 | 20346513101165 |
11 | 65349a9238709 |
12 | 234735a0a1125 |
13 | b4788b651cc4 |
14 | 504ac298240d |
15 | 2543d5c19645 |
hex | 12814aaf916d |
20346513101165 has 8 divisors (see below), whose sum is σ = 24517126161528. Its totient is φ = 16209670187520.
The previous prime is 20346513101143. The next prime is 20346513101183. The reversal of 20346513101165 is 56110131564302.
It can be written as a sum of positive squares in 4 ways, for example, as 3653625810916 + 16692887290249 = 1911446^2 + 4085693^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 20346513101165 - 212 = 20346513097069 is a prime.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 8442535352 + ... + 8442537761.
It is an arithmetic number, because the mean of its divisors is an integer number (3064640770191).
Almost surely, 220346513101165 is an apocalyptic number.
It is an amenable number.
20346513101165 is a deficient number, since it is larger than the sum of its proper divisors (4170613060363).
20346513101165 is a wasteful number, since it uses less digits than its factorization.
20346513101165 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16885073359.
The product of its (nonzero) digits is 64800, while the sum is 38.
Adding to 20346513101165 its reverse (56110131564302), we get a palindrome (76456644665467).
The spelling of 20346513101165 in words is "twenty trillion, three hundred forty-six billion, five hundred thirteen million, one hundred one thousand, one hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •