Base | Representation |
---|---|
bin | 1000111101111100000001101… |
… | …1111011000100010010001001 |
3 | 10001202100221000201002110122010 |
4 | 2033133000123323010102021 |
5 | 1130203121303333214221 |
6 | 10114045004410450133 |
7 | 246630650356564464 |
oct | 21737003373042211 |
9 | 3052327021073563 |
10 | 631051423335561 |
11 | 173088450aa6018 |
12 | 5a939bb0a33949 |
13 | 21116b80b135c7 |
14 | b1b90a241a2db |
15 | 4ce5168006c76 |
hex | 23df01bec4489 |
631051423335561 has 16 divisors (see below), whose sum is σ = 847023323169920. Its totient is φ = 417890560060800.
The previous prime is 631051423335497. The next prime is 631051423335587. The reversal of 631051423335561 is 165533324150136.
It is not a de Polignac number, because 631051423335561 - 26 = 631051423335497 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 631051423335561.
It is not an unprimeable number, because it can be changed into a prime (631051423335061) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 32678770 + ... + 48270123.
It is an arithmetic number, because the mean of its divisors is an integer number (52938957698120).
Almost surely, 2631051423335561 is an apocalyptic number.
It is an amenable number.
631051423335561 is a deficient number, since it is larger than the sum of its proper divisors (215971899834359).
631051423335561 is a wasteful number, since it uses less digits than its factorization.
631051423335561 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 80966256.
The product of its (nonzero) digits is 2916000, while the sum is 48.
Adding to 631051423335561 its reverse (165533324150136), we get a palindrome (796584747485697).
The spelling of 631051423335561 in words is "six hundred thirty-one trillion, fifty-one billion, four hundred twenty-three million, three hundred thirty-five thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •