Base | Representation |
---|---|
bin | 10110101101001… |
… | …01001000101010 |
3 | 111021101210212110 |
4 | 23112211020222 |
5 | 342224444100 |
6 | 30522223150 |
7 | 4501646121 |
oct | 1326451052 |
9 | 437353773 |
10 | 190468650 |
11 | 98572a09 |
12 | 53954ab6 |
13 | 305cab58 |
14 | 1b420ab8 |
15 | 11ac5250 |
hex | b5a522a |
190468650 has 48 divisors (see below), whose sum is σ = 487611648. Its totient is φ = 49152000.
The previous prime is 190468643. The next prime is 190468651. The reversal of 190468650 is 56864091.
It is a Smith number, since the sum of its digits (39) 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 = 190468599 and 190468608.
It is not an unprimeable number, because it can be changed into a prime (190468651) 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 23 ways as a sum of consecutive naturals, for example, 15831 + ... + 25130.
It is an arithmetic number, because the mean of its divisors is an integer number (10158576).
Almost surely, 2190468650 is an apocalyptic number.
190468650 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
190468650 is an abundant number, since it is smaller than the sum of its proper divisors (297142998).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
190468650 is a wasteful number, since it uses less digits than its factorization.
190468650 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41007 (or 41002 counting only the distinct ones).
The product of its (nonzero) digits is 51840, while the sum is 39.
The square root of 190468650 is about 13801.0380044401. The cubic root of 190468650 is about 575.3619900835.
The spelling of 190468650 in words is "one hundred ninety million, four hundred sixty-eight thousand, six hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •