Base | Representation |
---|---|
bin | 11001001101100101000110… |
… | …01000001111011101100101 |
3 | 21021022012221110222200100222 |
4 | 30212302203020033131211 |
5 | 24231331033211002321 |
6 | 313525441120214125 |
7 | 14451364526225360 |
oct | 1446624310173545 |
9 | 237265843880328 |
10 | 55442174703461 |
11 | 16735992277977 |
12 | 627509416a345 |
13 | 24c22368c02c0 |
14 | d995b64950d7 |
15 | 6622a16333ab |
hex | 326ca320f765 |
55442174703461 has 64 divisors (see below), whose sum is σ = 72060450201600. Its totient is φ = 41423100364800.
The previous prime is 55442174703451. The next prime is 55442174703521. The reversal of 55442174703461 is 16430747124455.
It is a happy number.
55442174703461 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 55442174703461 - 230 = 55441100961637 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (55442174703451) by changing a digit.
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 63 ways as a sum of consecutive naturals, for example, 3982621781 + ... + 3982635701.
It is an arithmetic number, because the mean of its divisors is an integer number (1125944534400).
Almost surely, 255442174703461 is an apocalyptic number.
It is an amenable number.
55442174703461 is a deficient number, since it is larger than the sum of its proper divisors (16618275498139).
55442174703461 is a wasteful number, since it uses less digits than its factorization.
55442174703461 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21250.
The product of its (nonzero) digits is 11289600, while the sum is 53.
The spelling of 55442174703461 in words is "fifty-five trillion, four hundred forty-two billion, one hundred seventy-four million, seven hundred three thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •