Base | Representation |
---|---|
bin | 100110010111101111001… |
… | …0011011001010000100101 |
3 | 200200011020001100000001121 |
4 | 1030233132103121100211 |
5 | 1142400421022421331 |
6 | 15114403342053541 |
7 | 1053003034421665 |
oct | 114573623312045 |
9 | 20604201300047 |
10 | 5273654498341 |
11 | 17535a9531499 |
12 | 7120a027a2b1 |
13 | 2c33c39ac928 |
14 | 1433639781a5 |
15 | 922a7030c11 |
hex | 4cbde4d9425 |
5273654498341 has 2 divisors, whose sum is σ = 5273654498342. Its totient is φ = 5273654498340.
The previous prime is 5273654498293. The next prime is 5273654498401. The reversal of 5273654498341 is 1438944563725.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3889158689025 + 1384495809316 = 1972095^2 + 1176646^2 .
It is a cyclic number.
It is not a de Polignac number, because 5273654498341 - 231 = 5271507014693 is a prime.
It is a super-2 number, since 2×52736544983412 (a number of 26 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 5273654498341.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5273654498641) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2636827249170 + 2636827249171.
It is an arithmetic number, because the mean of its divisors is an integer number (2636827249171).
Almost surely, 25273654498341 is an apocalyptic number.
It is an amenable number.
5273654498341 is a deficient number, since it is larger than the sum of its proper divisors (1).
5273654498341 is an equidigital number, since it uses as much as digits as its factorization.
5273654498341 is an evil number, because the sum of its binary digits is even.
The product of its digits is 87091200, while the sum is 61.
The spelling of 5273654498341 in words is "five trillion, two hundred seventy-three billion, six hundred fifty-four million, four hundred ninety-eight thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •