Base | Representation |
---|---|
bin | 10110000010111010101… |
… | …01101000011100011100 |
3 | 2200102012002121220001012 |
4 | 23001131111220130130 |
5 | 44402304412231433 |
6 | 1335552005234352 |
7 | 105504031300334 |
oct | 13013525503434 |
9 | 2612162556035 |
10 | 757480195868 |
11 | 272277906600 |
12 | 10297a7029b8 |
13 | 56578b52766 |
14 | 2893b2700c4 |
15 | 14a854bb848 |
hex | b05d56871c |
757480195868 has 144 divisors (see below), whose sum is σ = 1521737226240. Its totient is φ = 329308848000.
The previous prime is 757480195867. The next prime is 757480195873. The reversal of 757480195868 is 868591084757.
Added to its reverse (868591084757) it gives a square (1626071280625 = 12751752).
It is a junction number, because it is equal to n+sod(n) for n = 757480195798 and 757480195807.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (757480195867) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 548500538 + ... + 548501918.
Almost surely, 2757480195868 is an apocalyptic number.
It is an amenable number.
757480195868 is an abundant number, since it is smaller than the sum of its proper divisors (764257030372).
757480195868 is a wasteful number, since it uses less digits than its factorization.
757480195868 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1840 (or 1827 counting only the distinct ones).
The product of its (nonzero) digits is 135475200, while the sum is 68.
Adding to 757480195868 its reverse (868591084757), we get a square (1626071280625 = 12751752).
Subtracting 757480195868 from its reverse (868591084757), we obtain a square (111110888889 = 3333332).
The spelling of 757480195868 in words is "seven hundred fifty-seven billion, four hundred eighty million, one hundred ninety-five thousand, eight hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •