Base | Representation |
---|---|
bin | 101011001010011010011… |
… | …0000110100111001000001 |
3 | 210000010010122211110000001 |
4 | 1112110310300310321001 |
5 | 1234143204133104221 |
6 | 20341121533000001 |
7 | 1151406212643001 |
oct | 126246460647101 |
9 | 23003118743001 |
10 | 5932235050561 |
11 | 198793503aa06 |
12 | 7b9859623001 |
13 | 34053ac99891 |
14 | 16719bd7a001 |
15 | a449ebb9391 |
hex | 56534c34e41 |
5932235050561 has 4 divisors (see below), whose sum is σ = 5932646997124. Its totient is φ = 5931823104000.
The previous prime is 5932235050519. The next prime is 5932235050571. The reversal of 5932235050561 is 1650505322395.
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 4300563488400 + 1631671562161 = 2073780^2 + 1277369^2 .
It is a cyclic number.
It is not a de Polignac number, because 5932235050561 - 217 = 5932234919489 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5932235050571) 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 3 ways as a sum of consecutive naturals, for example, 205951680 + ... + 205980481.
It is an arithmetic number, because the mean of its divisors is an integer number (1483161749281).
Almost surely, 25932235050561 is an apocalyptic number.
It is an amenable number.
5932235050561 is a deficient number, since it is larger than the sum of its proper divisors (411946563).
5932235050561 is a wasteful number, since it uses less digits than its factorization.
5932235050561 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 411946562.
The product of its (nonzero) digits is 1215000, while the sum is 46.
The spelling of 5932235050561 in words is "five trillion, nine hundred thirty-two billion, two hundred thirty-five million, fifty thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •