Base | Representation |
---|---|
bin | 10110101111010… |
… | …01010000000000 |
3 | 111021220222120201 |
4 | 23113221100000 |
5 | 342312411043 |
6 | 30532214544 |
7 | 4504220410 |
oct | 1327512000 |
9 | 437828521 |
10 | 190747648 |
11 | 98743593 |
12 | 53a6a454 |
13 | 30697b40 |
14 | 1b494640 |
15 | 11b2cc4d |
hex | b5e9400 |
190747648 has 176 divisors, whose sum is σ = 495210240. Its totient is φ = 71368704.
The previous prime is 190747643. The next prime is 190747651. The reversal of 190747648 is 846747091.
It is a Harshad number since it is a multiple of its sum of digits (46).
It is a junction number, because it is equal to n+sod(n) for n = 190747598 and 190747607.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (190747643) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2143188 + ... + 2143276.
Almost surely, 2190747648 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 190747648, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (247605120).
190747648 is an abundant number, since it is smaller than the sum of its proper divisors (304462592).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
190747648 is a wasteful number, since it uses less digits than its factorization.
190747648 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 152 (or 134 counting only the distinct ones).
The product of its (nonzero) digits is 338688, while the sum is 46.
The square root of 190747648 is about 13811.1421685536. The cubic root of 190747648 is about 575.6427826259.
The spelling of 190747648 in words is "one hundred ninety million, seven hundred forty-seven thousand, six hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •