Base | Representation |
---|---|
bin | 10110110000111… |
… | …10010000011001 |
3 | 111022100000101221 |
4 | 23120132100121 |
5 | 342341333021 |
6 | 30541012041 |
7 | 4506113401 |
oct | 1330362031 |
9 | 438300357 |
10 | 190964761 |
11 | 98881719 |
12 | 53b54021 |
13 | 30742900 |
14 | 1b50d801 |
15 | 11b72241 |
hex | b61e419 |
190964761 has 9 divisors (see below), whose sum is σ = 206979039. Its totient is φ = 176109336.
The previous prime is 190964759. The next prime is 190964771. The reversal of 190964761 is 167469091.
It is a happy number.
The square root of 190964761 is 13819.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 28249225 + 162715536 = 5315^2 + 12756^2 .
It is not a de Polignac number, because 190964761 - 21 = 190964759 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (190964771) 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 8 ways as a sum of consecutive naturals, for example, 179116 + ... + 180178.
It is an arithmetic number, because the mean of its divisors is an integer number (22997671).
Almost surely, 2190964761 is an apocalyptic number.
190964761 is the 13819-th square number.
190964761 is the 6910-th centered octagonal number.
It is an amenable number.
190964761 is a deficient number, since it is larger than the sum of its proper divisors (16014278).
190964761 is an frugal number, since it uses more digits than its factorization.
190964761 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2152 (or 1076 counting only the distinct ones).
The product of its (nonzero) digits is 81648, while the sum is 43.
The cubic root of 190964761 is about 575.8611027373.
The spelling of 190964761 in words is "one hundred ninety million, nine hundred sixty-four thousand, seven hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •