Base | Representation |
---|---|
bin | 10110101100011… |
… | …00100110000100 |
3 | 111021012200222120 |
4 | 23112030212010 |
5 | 342213240012 |
6 | 30520125540 |
7 | 4501050063 |
oct | 1326144604 |
9 | 437180876 |
10 | 190368132 |
11 | 98504439 |
12 | 539068b0 |
13 | 30594186 |
14 | 1b3d61da |
15 | 11aa558c |
hex | b58c984 |
190368132 has 12 divisors (see below), whose sum is σ = 444192336. Its totient is φ = 63456040.
The previous prime is 190368131. The next prime is 190368137. The reversal of 190368132 is 231863091.
It is a tau number, because it is divible by the number of its divisors (12).
It is a Smith number, since the sum of its digits (33) coincides with the sum of the digits of its prime factors.
It is a junction number, because it is equal to n+sod(n) for n = 190368093 and 190368102.
It is not an unprimeable number, because it can be changed into a prime (190368131) 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, 7931994 + ... + 7932017.
It is an arithmetic number, because the mean of its divisors is an integer number (37016028).
Almost surely, 2190368132 is an apocalyptic number.
190368132 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
190368132 is an abundant number, since it is smaller than the sum of its proper divisors (253824204).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
190368132 is a wasteful number, since it uses less digits than its factorization.
190368132 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15864018 (or 15864016 counting only the distinct ones).
The product of its (nonzero) digits is 7776, while the sum is 33.
The square root of 190368132 is about 13797.3958412448. The cubic root of 190368132 is about 575.2607583527.
The spelling of 190368132 in words is "one hundred ninety million, three hundred sixty-eight thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •