Base | Representation |
---|---|
bin | 10000000000110100111… |
… | …10100111001101100001 |
3 | 1221121011101110021222112 |
4 | 20000122132213031201 |
5 | 33003302202441213 |
6 | 1100431452245105 |
7 | 54515320142012 |
oct | 10003236471541 |
9 | 1847141407875 |
10 | 550200046433 |
11 | 1a237a645384 |
12 | 8a770a70795 |
13 | 3cb6448cc6b |
14 | 1c8b6349009 |
15 | e4a2d40ea8 |
hex | 801a7a7361 |
550200046433 has 2 divisors, whose sum is σ = 550200046434. Its totient is φ = 550200046432.
The previous prime is 550200046411. The next prime is 550200046469. The reversal of 550200046433 is 334640002055.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 548417264704 + 1782781729 = 740552^2 + 42223^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-550200046433 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 550200046433.
It is not a weakly prime, because it can be changed into another prime (550200049433) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 275100023216 + 275100023217.
It is an arithmetic number, because the mean of its divisors is an integer number (275100023217).
Almost surely, 2550200046433 is an apocalyptic number.
It is an amenable number.
550200046433 is a deficient number, since it is larger than the sum of its proper divisors (1).
550200046433 is an equidigital number, since it uses as much as digits as its factorization.
550200046433 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 43200, while the sum is 32.
Adding to 550200046433 its reverse (334640002055), we get a palindrome (884840048488).
The spelling of 550200046433 in words is "five hundred fifty billion, two hundred million, forty-six thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •