Base | Representation |
---|---|
bin | 10101001000010000001010… |
… | …00010010000010000011001 |
3 | 20002111211020012012112201201 |
4 | 22210020011002100100121 |
5 | 22042222301403410311 |
6 | 242452454244114201 |
7 | 12533562314326546 |
oct | 1244100502202031 |
9 | 202454205175651 |
10 | 46463040685081 |
11 | 138939571a5659 |
12 | 5264a22395961 |
13 | 1cc05a49508c7 |
14 | b68b74ab7bcd |
15 | 558924c2e9c1 |
hex | 2a4205090419 |
46463040685081 has 2 divisors, whose sum is σ = 46463040685082. Its totient is φ = 46463040685080.
The previous prime is 46463040685067. The next prime is 46463040685097. The reversal of 46463040685081 is 18058604036464.
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., 42372874208025 + 4090166477056 = 6509445^2 + 2022416^2 .
It is a cyclic number.
It is not a de Polignac number, because 46463040685081 - 27 = 46463040684953 is a prime.
It is a super-2 number, since 2×464630406850812 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (46463040685021) 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, 23231520342540 + 23231520342541.
It is an arithmetic number, because the mean of its divisors is an integer number (23231520342541).
Almost surely, 246463040685081 is an apocalyptic number.
It is an amenable number.
46463040685081 is a deficient number, since it is larger than the sum of its proper divisors (1).
46463040685081 is an equidigital number, since it uses as much as digits as its factorization.
46463040685081 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 13271040, while the sum is 55.
The spelling of 46463040685081 in words is "forty-six trillion, four hundred sixty-three billion, forty million, six hundred eighty-five thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •