Base | Representation |
---|---|
bin | 1001010010101001110110… |
… | …00110111100100000110001 |
3 | 2200100021221202000011100001 |
4 | 10221110323012330200301 |
5 | 10134230021140303122 |
6 | 111242222312030001 |
7 | 4206113515550425 |
oct | 451247306744061 |
9 | 80307852004301 |
10 | 20432151103537 |
11 | 65682546a6388 |
12 | 235ba7a092301 |
13 | b529888587a4 |
14 | 508cc8418b85 |
15 | 256749167527 |
hex | 12953b1bc831 |
20432151103537 has 2 divisors, whose sum is σ = 20432151103538. Its totient is φ = 20432151103536.
The previous prime is 20432151103517. The next prime is 20432151103591. The reversal of 20432151103537 is 73530115123402.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 19876893639201 + 555257464336 = 4458351^2 + 745156^2 .
It is a cyclic number.
It is not a de Polignac number, because 20432151103537 - 219 = 20432150579249 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20432151103496 and 20432151103505.
It is not a weakly prime, because it can be changed into another prime (20432151103517) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10216075551768 + 10216075551769.
It is an arithmetic number, because the mean of its divisors is an integer number (10216075551769).
Almost surely, 220432151103537 is an apocalyptic number.
It is an amenable number.
20432151103537 is a deficient number, since it is larger than the sum of its proper divisors (1).
20432151103537 is an equidigital number, since it uses as much as digits as its factorization.
20432151103537 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 75600, while the sum is 37.
Adding to 20432151103537 its reverse (73530115123402), we get a palindrome (93962266226939).
The spelling of 20432151103537 in words is "twenty trillion, four hundred thirty-two billion, one hundred fifty-one million, one hundred three thousand, five hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •