Base | Representation |
---|---|
bin | 111110100100001100000010… |
… | …1011110000001110101111101 |
3 | 2200011120011121200010120021001 |
4 | 1331020120011132001311331 |
5 | 1034113112232400413423 |
6 | 5230242434101210301 |
7 | 223630063620013426 |
oct | 17510300536016575 |
9 | 2604504550116231 |
10 | 550331431263613 |
11 | 14a39728192377a |
12 | 51881b02a00991 |
13 | 1a8100539842ac |
14 | 99c827d34064d |
15 | 43955b4313cad |
hex | 1f48605781d7d |
550331431263613 has 2 divisors, whose sum is σ = 550331431263614. Its totient is φ = 550331431263612.
The previous prime is 550331431263583. The next prime is 550331431263619. The reversal of 550331431263613 is 316362134133055.
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., 493317726513049 + 57013704750564 = 22210757^2 + 7550742^2 .
It is a cyclic number.
It is not a de Polignac number, because 550331431263613 - 221 = 550331429166461 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (550331431263619) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 275165715631806 + 275165715631807.
It is an arithmetic number, because the mean of its divisors is an integer number (275165715631807).
Almost surely, 2550331431263613 is an apocalyptic number.
It is an amenable number.
550331431263613 is a deficient number, since it is larger than the sum of its proper divisors (1).
550331431263613 is an equidigital number, since it uses as much as digits as its factorization.
550331431263613 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1749600, while the sum is 46.
Adding to 550331431263613 its reverse (316362134133055), we get a palindrome (866693565396668).
The spelling of 550331431263613 in words is "five hundred fifty trillion, three hundred thirty-one billion, four hundred thirty-one million, two hundred sixty-three thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •