Base | Representation |
---|---|
bin | 10000000111001110101… |
… | …11100000101110011001 |
3 | 1221221000221122202012012 |
4 | 20003213113200232121 |
5 | 33032322200423022 |
6 | 1102200525155305 |
7 | 54666440136521 |
oct | 10034727405631 |
9 | 1857027582165 |
10 | 553637514137 |
11 | 1a3883a41784 |
12 | 8b3700bbb35 |
13 | 402916a3b16 |
14 | 1cb20aaa681 |
15 | e6049e9de2 |
hex | 80e75e0b99 |
553637514137 has 2 divisors, whose sum is σ = 553637514138. Its totient is φ = 553637514136.
The previous prime is 553637514107. The next prime is 553637514151. The reversal of 553637514137 is 731415736355.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 419824947721 + 133812566416 = 647939^2 + 365804^2 .
It is a cyclic number.
It is not a de Polignac number, because 553637514137 - 214 = 553637497753 is a prime.
It is not a weakly prime, because it can be changed into another prime (553637514107) 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, 276818757068 + 276818757069.
It is an arithmetic number, because the mean of its divisors is an integer number (276818757069).
Almost surely, 2553637514137 is an apocalyptic number.
It is an amenable number.
553637514137 is a deficient number, since it is larger than the sum of its proper divisors (1).
553637514137 is an equidigital number, since it uses as much as digits as its factorization.
553637514137 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 3969000, while the sum is 50.
The spelling of 553637514137 in words is "five hundred fifty-three billion, six hundred thirty-seven million, five hundred fourteen thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •