Base | Representation |
---|---|
bin | 10100100110100… |
… | …11000101001101 |
3 | 110001012201122010 |
4 | 22103103011031 |
5 | 323221043203 |
6 | 25052211433 |
7 | 4166016423 |
oct | 1223230515 |
9 | 401181563 |
10 | 172831053 |
11 | 8961658a |
12 | 49a69b79 |
13 | 29a63ac5 |
14 | 18d4d113 |
15 | 1028e303 |
hex | a4d314d |
172831053 has 8 divisors (see below), whose sum is σ = 230518528. Its totient is φ = 115182144.
The previous prime is 172831007. The next prime is 172831069. The reversal of 172831053 is 350138271.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 172831053 - 217 = 172699981 is a prime.
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 172831053.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (172831003) 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 7 ways as a sum of consecutive naturals, for example, 3300 + ... + 18882.
It is an arithmetic number, because the mean of its divisors is an integer number (28814816).
Almost surely, 2172831053 is an apocalyptic number.
It is an amenable number.
172831053 is a deficient number, since it is larger than the sum of its proper divisors (57687475).
172831053 is a wasteful number, since it uses less digits than its factorization.
172831053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19283.
The product of its (nonzero) digits is 5040, while the sum is 30.
The square root of 172831053 is about 13146.5224679381. The cubic root of 172831053 is about 557.0240226782.
It can be divided in two parts, 17283 and 1053, that added together give a triangular number (18336 = T191).
The spelling of 172831053 in words is "one hundred seventy-two million, eight hundred thirty-one thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •