Base | Representation |
---|---|
bin | 10110000101011010001010… |
… | …01001100011000010111101 |
3 | 20100221201002102110110112122 |
4 | 23002231011021203002331 |
5 | 22331134244432042441 |
6 | 251142053514012325 |
7 | 13141441666256612 |
oct | 1302550511430275 |
9 | 210851072413478 |
10 | 48564355346621 |
11 | 14524033583184 |
12 | 55441204170a5 |
13 | 21137a3193c3a |
14 | bdc755044509 |
15 | 59340c58134b |
hex | 2c2b452630bd |
48564355346621 has 2 divisors, whose sum is σ = 48564355346622. Its totient is φ = 48564355346620.
The previous prime is 48564355346477. The next prime is 48564355346627. The reversal of 48564355346621 is 12664355346584.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 42065990788900 + 6498364557721 = 6485830^2 + 2549189^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-48564355346621 is a prime.
It is a super-2 number, since 2×485643553466212 (a number of 28 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (48564355346627) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 24282177673310 + 24282177673311.
It is an arithmetic number, because the mean of its divisors is an integer number (24282177673311).
Almost surely, 248564355346621 is an apocalyptic number.
It is an amenable number.
48564355346621 is a deficient number, since it is larger than the sum of its proper divisors (1).
48564355346621 is an equidigital number, since it uses as much as digits as its factorization.
48564355346621 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 248832000, while the sum is 62.
The spelling of 48564355346621 in words is "forty-eight trillion, five hundred sixty-four billion, three hundred fifty-five million, three hundred forty-six thousand, six hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •