Base | Representation |
---|---|
bin | 10011001111011010101010… |
… | …10001111101111110010111 |
3 | 12112210220111001011210211121 |
4 | 21213231111101331332113 |
5 | 21021211220310402201 |
6 | 225553250422544411 |
7 | 11624610554420464 |
oct | 1147552521757627 |
9 | 175726431153747 |
10 | 42311153606551 |
11 | 12533072185905 |
12 | 48b4227898107 |
13 | 1a7bc0364770b |
14 | a63c2952466b |
15 | 4d592468a9a1 |
hex | 267b5547df97 |
42311153606551 has 2 divisors, whose sum is σ = 42311153606552. Its totient is φ = 42311153606550.
The previous prime is 42311153606497. The next prime is 42311153606567. The reversal of 42311153606551 is 15560635111324.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 42311153606551 - 29 = 42311153606039 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 42311153606498 and 42311153606507.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (42311153606851) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 21155576803275 + 21155576803276.
It is an arithmetic number, because the mean of its divisors is an integer number (21155576803276).
Almost surely, 242311153606551 is an apocalyptic number.
42311153606551 is a deficient number, since it is larger than the sum of its proper divisors (1).
42311153606551 is an equidigital number, since it uses as much as digits as its factorization.
42311153606551 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 324000, while the sum is 43.
Adding to 42311153606551 its reverse (15560635111324), we get a palindrome (57871788717875).
The spelling of 42311153606551 in words is "forty-two trillion, three hundred eleven billion, one hundred fifty-three million, six hundred six thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •