Base | Representation |
---|---|
bin | 11001011010001110000111… |
… | …00001100110111000010111 |
3 | 21022211202001001022210220201 |
4 | 30231013003201212320113 |
5 | 24310440043014431131 |
6 | 314501151515241331 |
7 | 14524642001530000 |
oct | 1455070341467027 |
9 | 238752031283821 |
10 | 55876509920791 |
11 | 1689310517523a |
12 | 63252aa149247 |
13 | 25241947c3891 |
14 | db261a7561a7 |
15 | 66d722544761 |
hex | 32d1c3866e17 |
55876509920791 has 60 divisors (see below), whose sum is σ = 70284555045936. Its totient is φ = 44333954945280.
The previous prime is 55876509920753. The next prime is 55876509920851. The reversal of 55876509920791 is 19702990567855.
55876509920791 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 55876509920791 - 27 = 55876509920663 is a prime.
It is a Smith number, since the sum of its digits (73) coincides with the sum of the digits of its prime factors.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (55876509920701) 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 59 ways as a sum of consecutive naturals, for example, 52542855 + ... + 53595751.
Almost surely, 255876509920791 is an apocalyptic number.
55876509920791 is a deficient number, since it is larger than the sum of its proper divisors (14408045125145).
55876509920791 is an equidigital number, since it uses as much as digits as its factorization.
55876509920791 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1053010 (or 1052958 counting only the distinct ones).
The product of its (nonzero) digits is 428652000, while the sum is 73.
The spelling of 55876509920791 in words is "fifty-five trillion, eight hundred seventy-six billion, five hundred nine million, nine hundred twenty thousand, seven hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •