Base | Representation |
---|---|
bin | 11001001100011001011001… |
… | …00110111010100110110100 |
3 | 21021011100000222201120100211 |
4 | 30212030230212322212310 |
5 | 24230144314034101012 |
6 | 313455040124315204 |
7 | 14445425412145105 |
oct | 1446145446724664 |
9 | 237140028646324 |
10 | 55401531550132 |
11 | 1671a726277259 |
12 | 62692309a2b04 |
13 | 24bb45a513251 |
14 | d9763c70a3ac |
15 | 6611c34576a7 |
hex | 32632c9ba9b4 |
55401531550132 has 24 divisors (see below), whose sum is σ = 103081736668680. Its totient is φ = 25963129251840.
The previous prime is 55401531550117. The next prime is 55401531550187. The reversal of 55401531550132 is 23105513510455.
55401531550132 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 4 ways, for example, as 5413746948516 + 49987784601616 = 2326746^2 + 7070204^2 .
It is a congruent number.
It is an unprimeable number.
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 in 7 ways as a sum of consecutive naturals, for example, 1690291507 + ... + 1690324282.
It is an arithmetic number, because the mean of its divisors is an integer number (4295072361195).
Almost surely, 255401531550132 is an apocalyptic number.
It is an amenable number.
55401531550132 is a deficient number, since it is larger than the sum of its proper divisors (47680205118548).
55401531550132 is a wasteful number, since it uses less digits than its factorization.
55401531550132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3380616051 (or 3380616049 counting only the distinct ones).
The product of its (nonzero) digits is 225000, while the sum is 40.
The spelling of 55401531550132 in words is "fifty-five trillion, four hundred one billion, five hundred thirty-one million, five hundred fifty thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.028 sec. • engine limits •