Base | Representation |
---|---|
bin | 10110110000110… |
… | …10110100100010 |
3 | 111022022022002210 |
4 | 23120122310202 |
5 | 342340410230 |
6 | 30540422550 |
7 | 4506024360 |
oct | 1330326442 |
9 | 438268083 |
10 | 190950690 |
11 | 98872097 |
12 | 53b47a56 |
13 | 30739398 |
14 | 1b508630 |
15 | 11b6ceb0 |
hex | b61ad22 |
190950690 has 32 divisors (see below), whose sum is σ = 523751040. Its totient is φ = 43645824.
The previous prime is 190950689. The next prime is 190950691. The reversal of 190950690 is 96059091.
It is an interprime number because it is at equal distance from previous prime (190950689) and next prime (190950691).
It is a super-2 number, since 2×1909506902 = 72924332022952200, which contains 22 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (190950691) 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, 454435 + ... + 454854.
It is an arithmetic number, because the mean of its divisors is an integer number (16367220).
Almost surely, 2190950690 is an apocalyptic number.
190950690 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
190950690 is an abundant number, since it is smaller than the sum of its proper divisors (332800350).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
190950690 is a wasteful number, since it uses less digits than its factorization.
190950690 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 909306.
The product of its (nonzero) digits is 21870, while the sum is 39.
The square root of 190950690 is about 13818.4908727400. The cubic root of 190950690 is about 575.8469585211.
The spelling of 190950690 in words is "one hundred ninety million, nine hundred fifty thousand, six hundred ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •