Base | Representation |
---|---|
bin | 11000010011100110110011… |
… | …00111011101011110011001 |
3 | 21000020210101000101001211211 |
4 | 30021303121213131132121 |
5 | 24001212024323003031 |
6 | 305402405520223121 |
7 | 14154436243666363 |
oct | 1411633147353631 |
9 | 230223330331754 |
10 | 53450224031641 |
11 | 16038127026528 |
12 | 5bb3017a6aaa1 |
13 | 23a9446b80718 |
14 | d2b00ca6dd33 |
15 | 62a56a146bb1 |
hex | 309cd99dd799 |
53450224031641 has 2 divisors, whose sum is σ = 53450224031642. Its totient is φ = 53450224031640.
The previous prime is 53450224031509. The next prime is 53450224031717. The reversal of 53450224031641 is 14613042205435.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 45257439843225 + 8192784188416 = 6727365^2 + 2862304^2 .
It is a cyclic number.
It is not a de Polignac number, because 53450224031641 - 237 = 53312785078169 is a prime.
It is a super-2 number, since 2×534502240316412 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 53450224031594 and 53450224031603.
It is not a weakly prime, because it can be changed into another prime (53450224031741) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 26725112015820 + 26725112015821.
It is an arithmetic number, because the mean of its divisors is an integer number (26725112015821).
Almost surely, 253450224031641 is an apocalyptic number.
It is an amenable number.
53450224031641 is a deficient number, since it is larger than the sum of its proper divisors (1).
53450224031641 is an equidigital number, since it uses as much as digits as its factorization.
53450224031641 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 345600, while the sum is 40.
The spelling of 53450224031641 in words is "fifty-three trillion, four hundred fifty billion, two hundred twenty-four million, thirty-one thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •