Base | Representation |
---|---|
bin | 1001001101000100011011… |
… | …00110001101111010010111 |
3 | 2122122221122121212112121112 |
4 | 10212202031212031322113 |
5 | 10123104023421122123 |
6 | 111014125304005235 |
7 | 4156211356065644 |
oct | 446421546157227 |
9 | 78587577775545 |
10 | 20240261504663 |
11 | 64a3934a58632 |
12 | 232a84676081b |
13 | b3a8578c5545 |
14 | 4dd8c353cdcb |
15 | 251767c49d78 |
hex | 12688d98de97 |
20240261504663 has 2 divisors, whose sum is σ = 20240261504664. Its totient is φ = 20240261504662.
The previous prime is 20240261504581. The next prime is 20240261504761. The reversal of 20240261504663 is 36640516204202.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 20240261504663 - 212 = 20240261500567 is a prime.
It is a Sophie Germain prime.
It is a self number, because there is not a number n which added to its sum of digits gives 20240261504663.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20240261504063) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10120130752331 + 10120130752332.
It is an arithmetic number, because the mean of its divisors is an integer number (10120130752332).
Almost surely, 220240261504663 is an apocalyptic number.
20240261504663 is a deficient number, since it is larger than the sum of its proper divisors (1).
20240261504663 is an equidigital number, since it uses as much as digits as its factorization.
20240261504663 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 414720, while the sum is 41.
Adding to 20240261504663 its reverse (36640516204202), we get a palindrome (56880777708865).
The spelling of 20240261504663 in words is "twenty trillion, two hundred forty billion, two hundred sixty-one million, five hundred four thousand, six hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •