Base | Representation |
---|---|
bin | 100001101101011011110… |
… | …0111000110100000000001 |
3 | 121101220201120210012202201 |
4 | 1003122313213012200001 |
5 | 1101401444114211412 |
6 | 13504221324313201 |
7 | 655504266434032 |
oct | 103326747064001 |
9 | 17356646705681 |
10 | 4633055225857 |
11 | 152695a989643 |
12 | 629b009a2801 |
13 | 277b83a9a486 |
14 | 1203536cca89 |
15 | 807b2ca3e57 |
hex | 436b79c6801 |
4633055225857 has 2 divisors, whose sum is σ = 4633055225858. Its totient is φ = 4633055225856.
The previous prime is 4633055225849. The next prime is 4633055225879. The reversal of 4633055225857 is 7585225503364.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3557916427536 + 1075138798321 = 1886244^2 + 1036889^2 .
It is a cyclic number.
It is not a de Polignac number, because 4633055225857 - 23 = 4633055225849 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 4633055225798 and 4633055225807.
It is not a weakly prime, because it can be changed into another prime (4633055225257) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2316527612928 + 2316527612929.
It is an arithmetic number, because the mean of its divisors is an integer number (2316527612929).
Almost surely, 24633055225857 is an apocalyptic number.
It is an amenable number.
4633055225857 is a deficient number, since it is larger than the sum of its proper divisors (1).
4633055225857 is an equidigital number, since it uses as much as digits as its factorization.
4633055225857 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 30240000, while the sum is 55.
The spelling of 4633055225857 in words is "four trillion, six hundred thirty-three billion, fifty-five million, two hundred twenty-five thousand, eight hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •