Base | Representation |
---|---|
bin | 11001001110101111010011… |
… | …00100000010010001001001 |
3 | 21021110000202202012022102122 |
4 | 30213113221210002101021 |
5 | 24233004124320201413 |
6 | 314000030052341025 |
7 | 14454304646062004 |
oct | 1447275144022111 |
9 | 237400682168378 |
10 | 55482011100233 |
11 | 16750874942433 |
12 | 6280951314775 |
13 | 24c5c14ac0003 |
14 | d9b4b503653b |
15 | 663333aa0108 |
hex | 3275e9902449 |
55482011100233 has 8 divisors (see below), whose sum is σ = 55491567028128. Its totient is φ = 55472455998784.
The previous prime is 55482011100199. The next prime is 55482011100317. The reversal of 55482011100233 is 33200111028455.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 55482011100233 - 210 = 55482011099209 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 55482011100193 and 55482011100202.
It is not an unprimeable number, because it can be changed into a prime (55482011100133) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 142422866 + ... + 142811892.
It is an arithmetic number, because the mean of its divisors is an integer number (6936445878516).
Almost surely, 255482011100233 is an apocalyptic number.
It is an amenable number.
55482011100233 is a deficient number, since it is larger than the sum of its proper divisors (9555927895).
55482011100233 is a wasteful number, since it uses less digits than its factorization.
55482011100233 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 413223.
The product of its (nonzero) digits is 28800, while the sum is 35.
Adding to 55482011100233 its reverse (33200111028455), we get a palindrome (88682122128688).
The spelling of 55482011100233 in words is "fifty-five trillion, four hundred eighty-two billion, eleven million, one hundred thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •