Base | Representation |
---|---|
bin | 110011100010110101… |
… | …001110111110010101 |
3 | 12021212002210010212001 |
4 | 303202311032332111 |
5 | 1401321333311313 |
6 | 41231503555301 |
7 | 3666335360044 |
oct | 634265167625 |
9 | 167762703761 |
10 | 55345213333 |
11 | 21520a25a33 |
12 | a886bbbb31 |
13 | 52b0299b57 |
14 | 29705b455b |
15 | 168dc8badd |
hex | ce2d4ef95 |
55345213333 has 4 divisors (see below), whose sum is σ = 55346726668. Its totient is φ = 55343700000.
The previous prime is 55345213327. The next prime is 55345213433. The reversal of 55345213333 is 33331254355.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 41547891889 + 13797321444 = 203833^2 + 117462^2 .
It is a cyclic number.
It is not a de Polignac number, because 55345213333 - 29 = 55345212821 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 55345213292 and 55345213301.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (55345213433) 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, 700416 + ... + 775417.
It is an arithmetic number, because the mean of its divisors is an integer number (13836681667).
Almost surely, 255345213333 is an apocalyptic number.
It is an amenable number.
55345213333 is a deficient number, since it is larger than the sum of its proper divisors (1513335).
55345213333 is a wasteful number, since it uses less digits than its factorization.
55345213333 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1513334.
The product of its digits is 243000, while the sum is 37.
Adding to 55345213333 its reverse (33331254355), we get a palindrome (88676467688).
The spelling of 55345213333 in words is "fifty-five billion, three hundred forty-five million, two hundred thirteen thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •