Base | Representation |
---|---|
bin | 1001001111100000011100… |
… | …10000000000110000001111 |
3 | 2122221221212012101121002211 |
4 | 10213300032100000300033 |
5 | 10130442100211314322 |
6 | 111120421115531251 |
7 | 4165235161230442 |
oct | 447601620006017 |
9 | 78857765347084 |
10 | 20324024323087 |
11 | 652640897a901 |
12 | 2342b22759b27 |
13 | b45716476a24 |
14 | 50398bd2b659 |
15 | 253a1b73cb77 |
hex | 127c0e400c0f |
20324024323087 has 2 divisors, whose sum is σ = 20324024323088. Its totient is φ = 20324024323086.
The previous prime is 20324024323039. The next prime is 20324024323147. The reversal of 20324024323087 is 78032342042302.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20324024323087 is a prime.
It is a super-2 number, since 2×203240243230872 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20324024323007) 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, 10162012161543 + 10162012161544.
It is an arithmetic number, because the mean of its divisors is an integer number (10162012161544).
Almost surely, 220324024323087 is an apocalyptic number.
20324024323087 is a deficient number, since it is larger than the sum of its proper divisors (1).
20324024323087 is an equidigital number, since it uses as much as digits as its factorization.
20324024323087 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 387072, while the sum is 40.
Adding to 20324024323087 its reverse (78032342042302), we get a palindrome (98356366365389).
The spelling of 20324024323087 in words is "twenty trillion, three hundred twenty-four billion, twenty-four million, three hundred twenty-three thousand, eighty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •