Base | Representation |
---|---|
bin | 101000111101000100101… |
… | …0100100000110100001001 |
3 | 201221002200112210210102000 |
4 | 1101322021110200310021 |
5 | 1214210100004414031 |
6 | 15545443311301213 |
7 | 1120442464126242 |
oct | 121721124406411 |
9 | 21832615723360 |
10 | 5628711013641 |
11 | 1880139699601 |
12 | 76aa6bb1a809 |
13 | 31aa29036931 |
14 | 156606bbdcc9 |
15 | 9b637e513e6 |
hex | 51e89520d09 |
5628711013641 has 64 divisors (see below), whose sum is σ = 9026685619200. Its totient is φ = 3458643971328.
The previous prime is 5628711013609. The next prime is 5628711013643. The reversal of 5628711013641 is 1463101178265.
5628711013641 is a `hidden beast` number, since 5 + 6 + 287 + 1 + 1 + 0 + 1 + 364 + 1 = 666.
It is not a de Polignac number, because 5628711013641 - 25 = 5628711013609 is a prime.
It is a super-3 number, since 3×56287110136413 (a number of 39 digits) contains 333 as substring.
It is not an unprimeable number, because it can be changed into a prime (5628711013643) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 297441 + ... + 3368366.
It is an arithmetic number, because the mean of its divisors is an integer number (141041962800).
Almost surely, 25628711013641 is an apocalyptic number.
It is an amenable number.
5628711013641 is a deficient number, since it is larger than the sum of its proper divisors (3397974605559).
5628711013641 is a wasteful number, since it uses less digits than its factorization.
5628711013641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3665935 (or 3665929 counting only the distinct ones).
The product of its (nonzero) digits is 241920, while the sum is 45.
The spelling of 5628711013641 in words is "five trillion, six hundred twenty-eight billion, seven hundred eleven million, thirteen thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •