Base | Representation |
---|---|
bin | 10010010011110011000100… |
… | …10011010011011001001111 |
3 | 12021120001222212212200220021 |
4 | 21021321202103103121033 |
5 | 20234130423200110142 |
6 | 221344225543003011 |
7 | 11323611363602155 |
oct | 1111714223233117 |
9 | 167501885780807 |
10 | 40262672660047 |
11 | 11913338086392 |
12 | 4623213739467 |
13 | 19609a4c77266 |
14 | 9d2a1bda73d5 |
15 | 49c4d0378267 |
hex | 249e624d364f |
40262672660047 has 2 divisors, whose sum is σ = 40262672660048. Its totient is φ = 40262672660046.
The previous prime is 40262672660017. The next prime is 40262672660053. The reversal of 40262672660047 is 74006627626204.
40262672660047 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-40262672660047 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 40262672659976 and 40262672660003.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (40262672660017) 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, 20131336330023 + 20131336330024.
It is an arithmetic number, because the mean of its divisors is an integer number (20131336330024).
Almost surely, 240262672660047 is an apocalyptic number.
40262672660047 is a deficient number, since it is larger than the sum of its proper divisors (1).
40262672660047 is an equidigital number, since it uses as much as digits as its factorization.
40262672660047 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8128512, while the sum is 52.
The spelling of 40262672660047 in words is "forty trillion, two hundred sixty-two billion, six hundred seventy-two million, six hundred sixty thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •