Base | Representation |
---|---|
bin | 10110101100110… |
… | …10100001010100 |
3 | 111021022121020011 |
4 | 23112122201110 |
5 | 342222101142 |
6 | 30521250004 |
7 | 4501405300 |
oct | 1326324124 |
9 | 437277204 |
10 | 190425172 |
11 | 98543283 |
12 | 53933904 |
13 | 305b4122 |
14 | 1b40cd00 |
15 | 11ab7417 |
hex | b59a854 |
190425172 has 36 divisors (see below), whose sum is σ = 392991060. Its totient is φ = 80486784.
The previous prime is 190425149. The next prime is 190425217. The reversal of 190425172 is 271524091.
It can be written as a sum of positive squares in 2 ways, for example, as 38987536 + 151437636 = 6244^2 + 12306^2 .
It is a super-2 number, since 2×1904251722 = 72523492262459168, 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 11 ways as a sum of consecutive naturals, for example, 7654 + ... + 20962.
Almost surely, 2190425172 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 190425172, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (196495530).
190425172 is an abundant number, since it is smaller than the sum of its proper divisors (202565888).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
190425172 is a wasteful number, since it uses less digits than its factorization.
190425172 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13400 (or 13391 counting only the distinct ones).
The product of its (nonzero) digits is 5040, while the sum is 31.
The square root of 190425172 is about 13799.4627431650. The cubic root of 190425172 is about 575.3182077388.
The spelling of 190425172 in words is "one hundred ninety million, four hundred twenty-five thousand, one hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.020 sec. • engine limits •