Base | Representation |
---|---|
bin | 101001101101001101101… |
… | …0100101111001100110001 |
3 | 202021222112100220010202110 |
4 | 1103122123110233030301 |
5 | 1222403311110340203 |
6 | 20105141542435533 |
7 | 1131062406306105 |
oct | 123323324571461 |
9 | 22258470803673 |
10 | 5732092277553 |
11 | 190aa6a723294 |
12 | 786b02132ba9 |
13 | 3276c320c145 |
14 | 15b612d31905 |
15 | 9e188e41d03 |
hex | 5369b52f331 |
5732092277553 has 8 divisors (see below), whose sum is σ = 7820528999008. Its totient is φ = 3732525203904.
The previous prime is 5732092277501. The next prime is 5732092277557. The reversal of 5732092277553 is 3557722902375.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 5732092277553 - 26 = 5732092277489 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 5732092277493 and 5732092277502.
It is not an unprimeable number, because it can be changed into a prime (5732092277557) 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 7 ways as a sum of consecutive naturals, for example, 22217411800 + ... + 22217412057.
It is an arithmetic number, because the mean of its divisors is an integer number (977566124876).
Almost surely, 25732092277553 is an apocalyptic number.
It is an amenable number.
5732092277553 is a deficient number, since it is larger than the sum of its proper divisors (2088436721455).
5732092277553 is a wasteful number, since it uses less digits than its factorization.
5732092277553 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 44434823903.
The product of its (nonzero) digits is 27783000, while the sum is 57.
The spelling of 5732092277553 in words is "five trillion, seven hundred thirty-two billion, ninety-two million, two hundred seventy-seven thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •