Base | Representation |
---|---|
bin | 1000111110111010111001000… |
… | …0001101100000101111101000 |
3 | 10001220012011122220122022020212 |
4 | 2033232232100031200233220 |
5 | 1130323320112221302310 |
6 | 10120233054501040252 |
7 | 250101662440354535 |
oct | 21756562015405750 |
9 | 3056164586568225 |
10 | 632131411119080 |
11 | 173464475a43624 |
12 | 5aa933766b6088 |
13 | 21194975827562 |
14 | b215475b3bd8c |
15 | 4d132c6b27205 |
hex | 23eeb90360be8 |
632131411119080 has 16 divisors (see below), whose sum is σ = 1422295675018020. Its totient is φ = 252852564447616.
The previous prime is 632131411119041. The next prime is 632131411119083. The reversal of 632131411119080 is 80911114131236.
632131411119080 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 603394714040836 + 28736697078244 = 24564094^2 + 5360662^2 .
It is not an unprimeable number, because it can be changed into a prime (632131411119083) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7901642638949 + ... + 7901642639028.
Almost surely, 2632131411119080 is an apocalyptic number.
It is an amenable number.
632131411119080 is an abundant number, since it is smaller than the sum of its proper divisors (790164263898940).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
632131411119080 is a wasteful number, since it uses less digits than its factorization.
632131411119080 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15803285277988 (or 15803285277984 counting only the distinct ones).
The product of its (nonzero) digits is 31104, while the sum is 41.
The spelling of 632131411119080 in words is "six hundred thirty-two trillion, one hundred thirty-one billion, four hundred eleven million, one hundred nineteen thousand, eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •