Base | Representation |
---|---|
bin | 11001010100101010011000… |
… | …11100101010011001011011 |
3 | 21022011111002120122020120002 |
4 | 30222111030130222121123 |
5 | 24244322433043342442 |
6 | 314233325253323215 |
7 | 14505101301422006 |
oct | 1452251434523133 |
9 | 238144076566502 |
10 | 55685533574747 |
11 | 1681a113a9089a |
12 | 62b429063650b |
13 | 250c17ab1731b |
14 | da72a0c8653d |
15 | 6687963c0732 |
hex | 32a54c72a65b |
55685533574747 has 2 divisors, whose sum is σ = 55685533574748. Its totient is φ = 55685533574746.
The previous prime is 55685533574719. The next prime is 55685533574809. The reversal of 55685533574747 is 74747533558655.
55685533574747 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 55685533574747 - 224 = 55685516797531 is a prime.
It is a super-2 number, since 2×556855335747472 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (55685533574707) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 27842766787373 + 27842766787374.
It is an arithmetic number, because the mean of its divisors is an integer number (27842766787374).
Almost surely, 255685533574747 is an apocalyptic number.
55685533574747 is a deficient number, since it is larger than the sum of its proper divisors (1).
55685533574747 is an equidigital number, since it uses as much as digits as its factorization.
55685533574747 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 7408800000, while the sum is 74.
The spelling of 55685533574747 in words is "fifty-five trillion, six hundred eighty-five billion, five hundred thirty-three million, five hundred seventy-four thousand, seven hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •