Base | Representation |
---|---|
bin | 100011010010110010… |
… | …0100010111101100001 |
3 | 21020122002111222210001 |
4 | 1012211210202331201 |
5 | 2220210304440212 |
6 | 54452443140001 |
7 | 5322126423535 |
oct | 1064544427541 |
9 | 236562458701 |
10 | 75792265057 |
11 | 2a163837593 |
12 | 12832814601 |
13 | 71bb47b522 |
14 | 394ddcbbc5 |
15 | 1e88db2657 |
hex | 11a5922f61 |
75792265057 has 4 divisors (see below), whose sum is σ = 75806676756. Its totient is φ = 75777853360.
The previous prime is 75792265051. The next prime is 75792265069. The reversal of 75792265057 is 75056229757.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 25333178896 + 50459086161 = 159164^2 + 224631^2 .
It is a cyclic number.
It is not a de Polignac number, because 75792265057 - 27 = 75792264929 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 75792264989 and 75792265007.
It is not an unprimeable number, because it can be changed into a prime (75792265051) 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 3 ways as a sum of consecutive naturals, for example, 7197958 + ... + 7208479.
It is an arithmetic number, because the mean of its divisors is an integer number (18951669189).
Almost surely, 275792265057 is an apocalyptic number.
It is an amenable number.
75792265057 is a deficient number, since it is larger than the sum of its proper divisors (14411699).
75792265057 is a wasteful number, since it uses less digits than its factorization.
75792265057 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14411698.
The product of its (nonzero) digits is 9261000, while the sum is 55.
The spelling of 75792265057 in words is "seventy-five billion, seven hundred ninety-two million, two hundred sixty-five thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •