Base | Representation |
---|---|
bin | 11001001010100000000111… |
… | …01011110000111000101111 |
3 | 21020221002222021200202111001 |
4 | 30211100003223300320233 |
5 | 24223112442113230433 |
6 | 313405111155341131 |
7 | 14440632040661323 |
oct | 1445200353607057 |
9 | 236832867622431 |
10 | 55336420445743 |
11 | 166a50537a6888 |
12 | 625869b2b17a7 |
13 | 24b5281bc6548 |
14 | d94423113983 |
15 | 65e66215357d |
hex | 325403af0e2f |
55336420445743 has 4 divisors (see below), whose sum is σ = 56094453602608. Its totient is φ = 54578387288880.
The previous prime is 55336420445737. The next prime is 55336420445749. The reversal of 55336420445743 is 34754402463355.
It is a semiprime because it is the product of two primes.
It is an interprime number because it is at equal distance from previous prime (55336420445737) and next prime (55336420445749).
It is a cyclic number.
It is not a de Polignac number, because 55336420445743 - 25 = 55336420445711 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (55336420445749) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 379016578323 + ... + 379016578468.
It is an arithmetic number, because the mean of its divisors is an integer number (14023613400652).
Almost surely, 255336420445743 is an apocalyptic number.
55336420445743 is a deficient number, since it is larger than the sum of its proper divisors (758033156865).
55336420445743 is an equidigital number, since it uses as much as digits as its factorization.
55336420445743 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 758033156864.
The product of its (nonzero) digits is 72576000, while the sum is 55.
The spelling of 55336420445743 in words is "fifty-five trillion, three hundred thirty-six billion, four hundred twenty million, four hundred forty-five thousand, seven hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •