Base | Representation |
---|---|
bin | 10110000000100011010011… |
… | …00000000100000000001011 |
3 | 20100100202022022020211022122 |
4 | 23000101221200010000023 |
5 | 22320421000121112021 |
6 | 250533253055441455 |
7 | 13123413133103114 |
oct | 1300215140040013 |
9 | 210322268224278 |
10 | 48397461504011 |
11 | 1446a280333034 |
12 | 5517903b2628b |
13 | 2100b2690c709 |
14 | bd4641b2920b |
15 | 58dde0798bab |
hex | 2c046980400b |
48397461504011 has 2 divisors, whose sum is σ = 48397461504012. Its totient is φ = 48397461504010.
The previous prime is 48397461503947. The next prime is 48397461504023. The reversal of 48397461504011 is 11040516479384.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 48397461504011 - 26 = 48397461503947 is a prime.
It is a Sophie Germain prime.
It is not a weakly prime, because it can be changed into another prime (48397461504211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 24198730752005 + 24198730752006.
It is an arithmetic number, because the mean of its divisors is an integer number (24198730752006).
Almost surely, 248397461504011 is an apocalyptic number.
48397461504011 is a deficient number, since it is larger than the sum of its proper divisors (1).
48397461504011 is an equidigital number, since it uses as much as digits as its factorization.
48397461504011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2903040, while the sum is 53.
The spelling of 48397461504011 in words is "forty-eight trillion, three hundred ninety-seven billion, four hundred sixty-one million, five hundred four thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •