Base | Representation |
---|---|
bin | 1010000101010111011… |
… | …1001101111000111100 |
3 | 121120011100011201100020 |
4 | 2201111313031320330 |
5 | 10314243220330022 |
6 | 211330205532140 |
7 | 15342013105302 |
oct | 2412567157074 |
9 | 546140151306 |
10 | 173239230012 |
11 | 6751a035672 |
12 | 296a9574050 |
13 | 1344b07cb34 |
14 | 8555d54272 |
15 | 478dde735c |
hex | 2855dcde3c |
173239230012 has 12 divisors (see below), whose sum is σ = 404224870056. Its totient is φ = 57746410000.
The previous prime is 173239230011. The next prime is 173239230013. The reversal of 173239230012 is 210032932371.
It is an interprime number because it is at equal distance from previous prime (173239230011) and next prime (173239230013).
It is a tau number, because it is divible by the number of its divisors (12).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (173239230011) 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, 7218301239 + ... + 7218301262.
It is an arithmetic number, because the mean of its divisors is an integer number (33685405838).
Almost surely, 2173239230012 is an apocalyptic number.
173239230012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
173239230012 is an abundant number, since it is smaller than the sum of its proper divisors (230985640044).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
173239230012 is a wasteful number, since it uses less digits than its factorization.
173239230012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14436602508 (or 14436602506 counting only the distinct ones).
The product of its (nonzero) digits is 13608, while the sum is 33.
The spelling of 173239230012 in words is "one hundred seventy-three billion, two hundred thirty-nine million, two hundred thirty thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •