Base | Representation |
---|---|
bin | 10110101110111… |
… | …00100111001001 |
3 | 111021211100120102 |
4 | 23113130213021 |
5 | 342304232011 |
6 | 30531135145 |
7 | 4503613445 |
oct | 1327344711 |
9 | 437740512 |
10 | 190695881 |
11 | 98708702 |
12 | 53a444b5 |
13 | 3067a3cc |
14 | 1b47d825 |
15 | 11b1c73b |
hex | b5dc9c9 |
190695881 has 4 divisors (see below), whose sum is σ = 190763412. Its totient is φ = 190628352.
The previous prime is 190695863. The next prime is 190695887. The reversal of 190695881 is 188596091.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 188596091 = 2843 ⋅66337.
It can be written as a sum of positive squares in 2 ways, for example, as 145926400 + 44769481 = 12080^2 + 6691^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-190695881 is a prime.
It is a super-2 number, since 2×1906958812 = 72729838060732322, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (190695887) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 29336 + ... + 35241.
It is an arithmetic number, because the mean of its divisors is an integer number (47690853).
Almost surely, 2190695881 is an apocalyptic number.
It is an amenable number.
190695881 is a deficient number, since it is larger than the sum of its proper divisors (67531).
190695881 is an equidigital number, since it uses as much as digits as its factorization.
190695881 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 67530.
The product of its (nonzero) digits is 155520, while the sum is 47.
The square root of 190695881 is about 13809.2679385983. The cubic root of 190695881 is about 575.5907033536.
The spelling of 190695881 in words is "one hundred ninety million, six hundred ninety-five thousand, eight hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •