Base | Representation |
---|---|
bin | 11001001010111111001100… |
… | …00000111011000110011111 |
3 | 21020222201000220000012222121 |
4 | 30211133212000323012133 |
5 | 24223401123222422221 |
6 | 313420510402523411 |
7 | 14442062324330164 |
oct | 1445374600730637 |
9 | 236881026005877 |
10 | 55353102545311 |
11 | 1670113437512a |
12 | 625b976066567 |
13 | 24b6a1009228c |
14 | d951668c006b |
15 | 65ecdb982a41 |
hex | 3257e603b19f |
55353102545311 has 4 divisors (see below), whose sum is σ = 55353117509152. Its totient is φ = 55353087581472.
The previous prime is 55353102545233. The next prime is 55353102545327. The reversal of 55353102545311 is 11354520135355.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 55353102545311 - 213 = 55353102537119 is a prime.
It is a super-2 number, since 2×553531025453112 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (55353102545371) 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, 2554135 + ... + 10827271.
It is an arithmetic number, because the mean of its divisors is an integer number (13838279377288).
Almost surely, 255353102545311 is an apocalyptic number.
55353102545311 is a deficient number, since it is larger than the sum of its proper divisors (14963841).
55353102545311 is an equidigital number, since it uses as much as digits as its factorization.
55353102545311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14963840.
The product of its (nonzero) digits is 675000, while the sum is 43.
The spelling of 55353102545311 in words is "fifty-five trillion, three hundred fifty-three billion, one hundred two million, five hundred forty-five thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •