Base | Representation |
---|---|
bin | 1110111100000110011010… |
… | …1000011000010000011001 |
3 | 2011011021112122202211000212 |
4 | 3233001212220120100121 |
5 | 4123104241230113144 |
6 | 54533503551140505 |
7 | 3313500404100665 |
oct | 357014650302031 |
9 | 64137478684025 |
10 | 16425676801049 |
11 | 52630aa3794aa |
12 | 1a134a5b14735 |
13 | 921c1c638a49 |
14 | 40b0152c38a5 |
15 | 1d7409ad549e |
hex | ef066a18419 |
16425676801049 has 2 divisors, whose sum is σ = 16425676801050. Its totient is φ = 16425676801048.
The previous prime is 16425676801007. The next prime is 16425676801057. The reversal of 16425676801049 is 94010867652461.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 15597088969225 + 828587831824 = 3949315^2 + 910268^2 .
It is an emirp because it is prime and its reverse (94010867652461) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 16425676801049 - 212 = 16425676796953 is a prime.
It is not a weakly prime, because it can be changed into another prime (16425676881049) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 8212838400524 + 8212838400525.
It is an arithmetic number, because the mean of its divisors is an integer number (8212838400525).
Almost surely, 216425676801049 is an apocalyptic number.
It is an amenable number.
16425676801049 is a deficient number, since it is larger than the sum of its proper divisors (1).
16425676801049 is an equidigital number, since it uses as much as digits as its factorization.
16425676801049 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 17418240, while the sum is 59.
The spelling of 16425676801049 in words is "sixteen trillion, four hundred twenty-five billion, six hundred seventy-six million, eight hundred one thousand, forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •