Base | Representation |
---|---|
bin | 101101100001111000010… |
… | …011001100110110111101 |
3 | 102002002212021120002200001 |
4 | 231201320103030312331 |
5 | 402230142122201223 |
6 | 10353155135034301 |
7 | 442021311241240 |
oct | 55417023146675 |
9 | 12062767502601 |
10 | 3128754490813 |
11 | aa6996386376 |
12 | 42645966b991 |
13 | 19906a667c43 |
14 | ab60abc7257 |
15 | 565bd07c9ad |
hex | 2d8784ccdbd |
3128754490813 has 4 divisors (see below), whose sum is σ = 3575719418080. Its totient is φ = 2681789563548.
The previous prime is 3128754490811. The next prime is 3128754490817. The reversal of 3128754490813 is 3180944578213.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 3128754490813 - 21 = 3128754490811 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3128754490811) 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 3 ways as a sum of consecutive naturals, for example, 223482463623 + ... + 223482463636.
It is an arithmetic number, because the mean of its divisors is an integer number (893929854520).
Almost surely, 23128754490813 is an apocalyptic number.
It is an amenable number.
3128754490813 is a deficient number, since it is larger than the sum of its proper divisors (446964927267).
3128754490813 is an equidigital number, since it uses as much as digits as its factorization.
3128754490813 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 446964927266.
The product of its (nonzero) digits is 5806080, while the sum is 55.
The spelling of 3128754490813 in words is "three trillion, one hundred twenty-eight billion, seven hundred fifty-four million, four hundred ninety thousand, eight hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •