Base | Representation |
---|---|
bin | 1001010000010011111001… |
… | …00100111100000001000001 |
3 | 2200001121011010202202112111 |
4 | 10220021330210330001001 |
5 | 10131420132121344431 |
6 | 111141230001055321 |
7 | 4200233511063151 |
oct | 450117444740101 |
9 | 80047133682474 |
10 | 20351645106241 |
11 | 65370a2107019 |
12 | 2348350927541 |
13 | b481c894bbb7 |
14 | 50504c3a6761 |
15 | 2545d65487b1 |
hex | 12827c93c041 |
20351645106241 has 2 divisors, whose sum is σ = 20351645106242. Its totient is φ = 20351645106240.
The previous prime is 20351645106229. The next prime is 20351645106283. The reversal of 20351645106241 is 14260154615302.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10302719746225 + 10048925360016 = 3209785^2 + 3170004^2 .
It is a cyclic number.
It is not a de Polignac number, because 20351645106241 - 225 = 20351611551809 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20351645106194 and 20351645106203.
It is not a weakly prime, because it can be changed into another prime (20351645106941) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10175822553120 + 10175822553121.
It is an arithmetic number, because the mean of its divisors is an integer number (10175822553121).
Almost surely, 220351645106241 is an apocalyptic number.
It is an amenable number.
20351645106241 is a deficient number, since it is larger than the sum of its proper divisors (1).
20351645106241 is an equidigital number, since it uses as much as digits as its factorization.
20351645106241 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 172800, while the sum is 40.
The spelling of 20351645106241 in words is "twenty trillion, three hundred fifty-one billion, six hundred forty-five million, one hundred six thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •