Base | Representation |
---|---|
bin | 111100011001110011011100… |
… | …1101101101001111111010000 |
3 | 2120200012221020221121121001122 |
4 | 1320303212321231221333100 |
5 | 1024120004032021330404 |
6 | 5122001214533021412 |
7 | 216625012531052144 |
oct | 17063467155517720 |
9 | 2520187227547048 |
10 | 531312045105104 |
11 | 14432419a20482a |
12 | 4b70ba00a84868 |
13 | 19a606844c52a3 |
14 | 952b8d6991224 |
15 | 41659a3ccc3be |
hex | 1e339b9b69fd0 |
531312045105104 has 10 divisors (see below), whose sum is σ = 1029417087391170. Its totient is φ = 265656022552544.
The previous prime is 531312045105089. The next prime is 531312045105161. The reversal of 531312045105104 is 401501540213135.
It is a happy number.
It can be written as a sum of positive squares in only one way, i.e., 419389441000000 + 111922604105104 = 20479000^2 + 10579348^2 .
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 16603501409519 + ... + 16603501409550.
It is an arithmetic number, because the mean of its divisors is an integer number (102941708739117).
Almost surely, 2531312045105104 is an apocalyptic number.
It is an amenable number.
531312045105104 is a deficient number, since it is larger than the sum of its proper divisors (498105042286066).
531312045105104 is a wasteful number, since it uses less digits than its factorization.
531312045105104 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33207002819077 (or 33207002819071 counting only the distinct ones).
The product of its (nonzero) digits is 36000, while the sum is 35.
Adding to 531312045105104 its reverse (401501540213135), we get a palindrome (932813585318239).
The spelling of 531312045105104 in words is "five hundred thirty-one trillion, three hundred twelve billion, forty-five million, one hundred five thousand, one hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •