Base | Representation |
---|---|
bin | 1001000111111010010101… |
… | …1000010001001010100100 |
3 | 1022112000010002202200200121 |
4 | 2101332211120101022210 |
5 | 2303324024422113224 |
6 | 33200230153251324 |
7 | 2053516332426022 |
oct | 221764530211244 |
9 | 38460102680617 |
10 | 10031523238564 |
11 | 321838838a7a3 |
12 | 1160214a03b44 |
13 | 579c78c8b0c9 |
14 | 2697579a9712 |
15 | 125e22656be4 |
hex | 91fa56112a4 |
10031523238564 has 9 divisors (see below), whose sum is σ = 17555176752897. Its totient is φ = 5015758452024.
The previous prime is 10031523238559. The next prime is 10031523238591. The reversal of 10031523238564 is 46583232513001.
It is a happy number.
The square root of 10031523238564 is 3167258.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 1158512100964 + 8873011137600 = 1076342^2 + 2978760^2 .
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 10031523238564.
It is an unprimeable number.
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 2 ways as a sum of consecutive naturals, for example, 5542702 + ... + 7126330.
Almost surely, 210031523238564 is an apocalyptic number.
10031523238564 is the 3167258-th square number.
It is an amenable number.
10031523238564 is a deficient number, since it is larger than the sum of its proper divisors (7523653514333).
10031523238564 is an frugal number, since it uses more digits than its factorization.
10031523238564 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3167262 (or 1583631 counting only the distinct ones).
The product of its (nonzero) digits is 518400, while the sum is 43.
The spelling of 10031523238564 in words is "ten trillion, thirty-one billion, five hundred twenty-three million, two hundred thirty-eight thousand, five hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •