Base | Representation |
---|---|
bin | 10010111100110000… |
… | …01100100011000000 |
3 | 222020222221000001202 |
4 | 21132120030203000 |
5 | 131313333220434 |
6 | 4401253520332 |
7 | 510050632655 |
oct | 113630144300 |
9 | 28228830052 |
10 | 10173335744 |
11 | 43506457a0 |
12 | 1b7b0430a8 |
13 | c61899bc0 |
14 | 6c71a3c2c |
15 | 3e81eba7e |
hex | 25e60c8c0 |
10173335744 has 224 divisors, whose sum is σ = 24652809216. Its totient is φ = 4103700480.
The previous prime is 10173335719. The next prime is 10173335747. The reversal of 10173335744 is 44753337101.
It is a junction number, because it is equal to n+sod(n) for n = 10173335698 and 10173335707.
It is not an unprimeable number, because it can be changed into a prime (10173335747) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 28819472 + ... + 28819824.
It is an arithmetic number, because the mean of its divisors is an integer number (110057184).
Almost surely, 210173335744 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 10173335744, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (12326404608).
10173335744 is an abundant number, since it is smaller than the sum of its proper divisors (14479473472).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10173335744 is a wasteful number, since it uses less digits than its factorization.
10173335744 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 503 (or 493 counting only the distinct ones).
The product of its (nonzero) digits is 105840, while the sum is 38.
The spelling of 10173335744 in words is "ten billion, one hundred seventy-three million, three hundred thirty-five thousand, seven hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •