Base | Representation |
---|---|
bin | 10110101101100… |
… | …00101100100100 |
3 | 111021111012211022 |
4 | 23112300230210 |
5 | 342233003004 |
6 | 30523230312 |
7 | 4502234150 |
oct | 1326605444 |
9 | 437435738 |
10 | 190516004 |
11 | 985a5548 |
12 | 53978398 |
13 | 30616583 |
14 | 1b434060 |
15 | 11ad42be |
hex | b5b0b24 |
190516004 has 48 divisors (see below), whose sum is σ = 394813440. Its totient is φ = 78748320.
The previous prime is 190515989. The next prime is 190516009. The reversal of 190516004 is 400615091.
It is not an unprimeable number, because it can be changed into a prime (190516009) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 92417 + ... + 94455.
It is an arithmetic number, because the mean of its divisors is an integer number (8225280).
Almost surely, 2190516004 is an apocalyptic number.
190516004 is a gapful number since it is divisible by the number (14) 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 190516004, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (197406720).
190516004 is an abundant number, since it is smaller than the sum of its proper divisors (204297436).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
190516004 is a wasteful number, since it uses less digits than its factorization.
190516004 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2168 (or 2166 counting only the distinct ones).
The product of its (nonzero) digits is 1080, while the sum is 26.
The square root of 190516004 is about 13802.7534934157. The cubic root of 190516004 is about 575.4096679805.
The spelling of 190516004 in words is "one hundred ninety million, five hundred sixteen thousand, four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •