Base | Representation |
---|---|
bin | 1001010000010011111010… |
… | …10000011101001001100001 |
3 | 2200001121011221020100020110 |
4 | 10220021331100131021201 |
5 | 10131420143031423040 |
6 | 111141231045401533 |
7 | 4200234010045305 |
oct | 450117520351141 |
9 | 80047157210213 |
10 | 20351656514145 |
11 | 65370a8598a40 |
12 | 23483547092a9 |
13 | b481cb114538 |
14 | 50504dad5d05 |
15 | 2545d754d980 |
hex | 12827d41d261 |
20351656514145 has 64 divisors (see below), whose sum is σ = 36379881381888. Its totient is φ = 9632169120000.
The previous prime is 20351656514143. The next prime is 20351656514227. The reversal of 20351656514145 is 54141565615302.
It is not a de Polignac number, because 20351656514145 - 21 = 20351656514143 is a prime.
It is a super-2 number, since 2×203516565141452 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 20351656514094 and 20351656514103.
It is not an unprimeable number, because it can be changed into a prime (20351656514143) 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, 7416937 + ... + 9783366.
It is an arithmetic number, because the mean of its divisors is an integer number (568435646592).
Almost surely, 220351656514145 is an apocalyptic number.
It is an amenable number.
20351656514145 is a deficient number, since it is larger than the sum of its proper divisors (16028224867743).
20351656514145 is a wasteful number, since it uses less digits than its factorization.
20351656514145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17200494.
The product of its (nonzero) digits is 2160000, while the sum is 48.
The spelling of 20351656514145 in words is "twenty trillion, three hundred fifty-one billion, six hundred fifty-six million, five hundred fourteen thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •