Base | Representation |
---|---|
bin | 1001100001110000000111… |
… | …10100000011001101010101 |
3 | 2202011212222020202102211102 |
4 | 10300320003310003031111 |
5 | 10221224433044234130 |
6 | 112320414530515445 |
7 | 4261440122321654 |
oct | 460700364031525 |
9 | 82155866672742 |
10 | 20950914446165 |
11 | 6748262019910 |
12 | 2424516a35b85 |
13 | b8c8800c3762 |
14 | 52605b5b119b |
15 | 264eac189645 |
hex | 130e03d03355 |
20950914446165 has 16 divisors (see below), whose sum is σ = 27426746128320. Its totient is φ = 15236976193920.
The previous prime is 20950914446123. The next prime is 20950914446183. The reversal of 20950914446165 is 56164441905902.
It is a happy number.
It is not a de Polignac number, because 20950914446165 - 216 = 20950914380629 is a prime.
It is a super-2 number, since 2×209509144461652 (a number of 27 digits) contains 22 as substring.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 20950914446165.
It is a congruent number.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 23395802 + ... + 24274788.
It is an arithmetic number, because the mean of its divisors is an integer number (1714171633020).
Almost surely, 220950914446165 is an apocalyptic number.
It is an amenable number.
20950914446165 is a deficient number, since it is larger than the sum of its proper divisors (6475831682155).
20950914446165 is a wasteful number, since it uses less digits than its factorization.
20950914446165 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1312372.
The product of its (nonzero) digits is 9331200, while the sum is 56.
The spelling of 20950914446165 in words is "twenty trillion, nine hundred fifty billion, nine hundred fourteen million, four hundred forty-six thousand, one hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •