Base | Representation |
---|---|
bin | 10110101110001… |
… | …11010001010101 |
3 | 111021122220122221 |
4 | 23113013101111 |
5 | 342243432334 |
6 | 30525222341 |
7 | 4503100552 |
oct | 1327072125 |
9 | 437586587 |
10 | 190608469 |
11 | 98658a67 |
12 | 53a019b1 |
13 | 3064969c |
14 | 1b459a29 |
15 | 11b018b4 |
hex | b5c7455 |
190608469 has 4 divisors (see below), whose sum is σ = 193733260. Its totient is φ = 187483680.
The previous prime is 190608463. The next prime is 190608487. The reversal of 190608469 is 964806091.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 964806091 = 113 ⋅8538107.
It can be written as a sum of positive squares in 2 ways, for example, as 87179569 + 103428900 = 9337^2 + 10170^2 .
It is a cyclic number.
It is not a de Polignac number, because 190608469 - 29 = 190607957 is a prime.
It is a super-2 number, since 2×1906084692 = 72663176909047922, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (190608463) 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, 1562304 + ... + 1562425.
It is an arithmetic number, because the mean of its divisors is an integer number (48433315).
Almost surely, 2190608469 is an apocalyptic number.
It is an amenable number.
190608469 is a deficient number, since it is larger than the sum of its proper divisors (3124791).
190608469 is an equidigital number, since it uses as much as digits as its factorization.
190608469 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3124790.
The product of its (nonzero) digits is 93312, while the sum is 43.
The square root of 190608469 is about 13806.1025999375. The cubic root of 190608469 is about 575.5027426630.
The spelling of 190608469 in words is "one hundred ninety million, six hundred eight thousand, four hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •