Base | Representation |
---|---|
bin | 10101100001001010001010… |
… | …01010111110101010001111 |
3 | 20012112122010120221111220111 |
4 | 22300211011022332222033 |
5 | 22200232413143043111 |
6 | 244345544050100451 |
7 | 12652446231616435 |
oct | 1260450512765217 |
9 | 205478116844814 |
10 | 47318815206031 |
11 | 14093884648466 |
12 | 538285357a727 |
13 | 20531b6aca4a5 |
14 | b98358646d55 |
15 | 570d0e810a21 |
hex | 2b09452bea8f |
47318815206031 has 2 divisors, whose sum is σ = 47318815206032. Its totient is φ = 47318815206030.
The previous prime is 47318815206007. The next prime is 47318815206049. The reversal of 47318815206031 is 13060251881374.
47318815206031 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 not a de Polignac number, because 47318815206031 - 211 = 47318815203983 is a prime.
It is a super-2 number, since 2×473188152060312 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (47318815206001) 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, 23659407603015 + 23659407603016.
It is an arithmetic number, because the mean of its divisors is an integer number (23659407603016).
Almost surely, 247318815206031 is an apocalyptic number.
47318815206031 is a deficient number, since it is larger than the sum of its proper divisors (1).
47318815206031 is an equidigital number, since it uses as much as digits as its factorization.
47318815206031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 967680, while the sum is 49.
The spelling of 47318815206031 in words is "forty-seven trillion, three hundred eighteen billion, eight hundred fifteen million, two hundred six thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •