Base | Representation |
---|---|
bin | 10110101100101… |
… | …10110110010100 |
3 | 111021021211121010 |
4 | 23112112312110 |
5 | 342221111012 |
6 | 30521052220 |
7 | 4501313403 |
oct | 1326266624 |
9 | 437254533 |
10 | 190410132 |
11 | 98532a50 |
12 | 53927070 |
13 | 305aa323 |
14 | 1b40763a |
15 | 11ab2c3c |
hex | b596d94 |
190410132 has 96 divisors (see below), whose sum is σ = 523200384. Its totient is φ = 53248000.
The previous prime is 190410119. The next prime is 190410151. The reversal of 190410132 is 231014091.
It is a junction number, because it is equal to n+sod(n) for n = 190410099 and 190410108.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 118132 + ... + 119732.
It is an arithmetic number, because the mean of its divisors is an integer number (5450004).
Almost surely, 2190410132 is an apocalyptic number.
190410132 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 190410132, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (261600192).
190410132 is an abundant number, since it is smaller than the sum of its proper divisors (332790252).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
190410132 is a wasteful number, since it uses less digits than its factorization.
190410132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1689 (or 1687 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 21.
The square root of 190410132 is about 13798.9177836525. The cubic root of 190410132 is about 575.3030609078.
The spelling of 190410132 in words is "one hundred ninety million, four hundred ten thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •