Base | Representation |
---|---|
bin | 1001110110011100110101… |
… | …1111001111001001110101 |
3 | 1102100102212012101002021002 |
4 | 2131213031133033021311 |
5 | 2404424002334233104 |
6 | 35011415330333045 |
7 | 2165342523400262 |
oct | 235471537171165 |
9 | 42312765332232 |
10 | 10831060071029 |
11 | 34a6477054900 |
12 | 126b17012a185 |
13 | 607497caa543 |
14 | 296324606269 |
15 | 13bb19e5901e |
hex | 9d9cd7cf275 |
10831060071029 has 6 divisors (see below), whose sum is σ = 11905214788950. Its totient is φ = 9846418246280.
The previous prime is 10831060070977. The next prime is 10831060071031. The reversal of 10831060071029 is 92017006013801.
It can be written as a sum of positive squares in only one way, i.e., 10003145700625 + 827914370404 = 3162775^2 + 909898^2 .
It is not a de Polignac number, because 10831060071029 - 224 = 10831043293813 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10831060070983 and 10831060071001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10831060071529) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 44756446454 + ... + 44756446695.
It is an arithmetic number, because the mean of its divisors is an integer number (1984202464825).
Almost surely, 210831060071029 is an apocalyptic number.
It is an amenable number.
10831060071029 is a deficient number, since it is larger than the sum of its proper divisors (1074154717921).
10831060071029 is an equidigital number, since it uses as much as digits as its factorization.
10831060071029 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 89512893171 (or 89512893160 counting only the distinct ones).
The product of its (nonzero) digits is 18144, while the sum is 38.
The spelling of 10831060071029 in words is "ten trillion, eight hundred thirty-one billion, sixty million, seventy-one thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.161 sec. • engine limits •