Base | Representation |
---|---|
bin | 10110101010100… |
… | …11001011100101 |
3 | 111020202202101200 |
4 | 23111103023211 |
5 | 342133223330 |
6 | 30511113113 |
7 | 4466050341 |
oct | 1325231345 |
9 | 436682350 |
10 | 190132965 |
11 | 98363790 |
12 | 53812799 |
13 | 30511119 |
14 | 1b374621 |
15 | 11a5aa60 |
hex | b5532e5 |
190132965 has 24 divisors (see below), whose sum is σ = 359525088. Its totient is φ = 92185440.
The previous prime is 190132963. The next prime is 190132967. The reversal of 190132965 is 569231091.
It is an interprime number because it is at equal distance from previous prime (190132963) and next prime (190132967).
It is not a de Polignac number, because 190132965 - 21 = 190132963 is a prime.
It is a Smith number, since the sum of its digits (36) coincides with the sum of the digits of its prime factors.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (190132963) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 191559 + ... + 192548.
It is an arithmetic number, because the mean of its divisors is an integer number (14980212).
Almost surely, 2190132965 is an apocalyptic number.
190132965 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
190132965 is a deficient number, since it is larger than the sum of its proper divisors (169392123).
190132965 is a wasteful number, since it uses less digits than its factorization.
190132965 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 384129 (or 384126 counting only the distinct ones).
The product of its (nonzero) digits is 14580, while the sum is 36.
The square root of 190132965 is about 13788.8710560365. The cubic root of 190132965 is about 575.0237822552.
The spelling of 190132965 in words is "one hundred ninety million, one hundred thirty-two thousand, nine hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •