Base | Representation |
---|---|
bin | 10100100001101… |
… | …10101010111000 |
3 | 110000000011210221 |
4 | 22100312222320 |
5 | 323040043032 |
6 | 25030345424 |
7 | 4160410543 |
oct | 1220665270 |
9 | 400004727 |
10 | 172190392 |
11 | 89219210 |
12 | 497bb274 |
13 | 2989b30a |
14 | 18c2385a |
15 | 101b4597 |
hex | a436ab8 |
172190392 has 32 divisors (see below), whose sum is σ = 355518720. Its totient is φ = 77532640.
The previous prime is 172190357. The next prime is 172190453. The reversal of 172190392 is 293091271.
It is a happy number.
It is a super-2 number, since 2×1721903922 = 59299062194227328, which contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
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, 273 + ... + 18559.
It is an arithmetic number, because the mean of its divisors is an integer number (11109960).
Almost surely, 2172190392 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 172190392, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (177759360).
172190392 is an abundant number, since it is smaller than the sum of its proper divisors (183328328).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
172190392 is a wasteful number, since it uses less digits than its factorization.
172190392 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18411 (or 18407 counting only the distinct ones).
The product of its (nonzero) digits is 6804, while the sum is 34.
The square root of 172190392 is about 13122.1336679673. The cubic root of 172190392 is about 556.3348999393.
The spelling of 172190392 in words is "one hundred seventy-two million, one hundred ninety thousand, three hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •