Base | Representation |
---|---|
bin | 1001010010101110100010… |
… | …00000000001000000000101 |
3 | 2200100112102222222111110101 |
4 | 10221113101000001000011 |
5 | 10134300143430304232 |
6 | 111243320024124101 |
7 | 4206233032655200 |
oct | 451272100010005 |
9 | 80315388874411 |
10 | 20434665869317 |
11 | 6569325175107 |
12 | 2360460306631 |
13 | b52c99857a8b |
14 | 5090863d0937 |
15 | 256844d0d1e7 |
hex | 1295d1001005 |
20434665869317 has 12 divisors (see below), whose sum is σ = 23771516561856. Its totient is φ = 17515001467320.
The previous prime is 20434665869273. The next prime is 20434665869323. The reversal of 20434665869317 is 71396856643402.
It is not a de Polignac number, because 20434665869317 - 223 = 20434657480709 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20434665869377) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 3034909 + ... + 7076722.
It is an arithmetic number, because the mean of its divisors is an integer number (1980959713488).
It is a 1-persistent number, because it is pandigital, but 2⋅20434665869317 = 40869331738634 is not.
Almost surely, 220434665869317 is an apocalyptic number.
It is an amenable number.
20434665869317 is a deficient number, since it is larger than the sum of its proper divisors (3336850692539).
20434665869317 is a wasteful number, since it uses less digits than its factorization.
20434665869317 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10152888 (or 10152881 counting only the distinct ones).
The product of its (nonzero) digits is 156764160, while the sum is 64.
The spelling of 20434665869317 in words is "twenty trillion, four hundred thirty-four billion, six hundred sixty-five million, eight hundred sixty-nine thousand, three hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •