Base | Representation |
---|---|
bin | 10110101010000… |
… | …10111100100101 |
3 | 111020122101011212 |
4 | 23111002330211 |
5 | 342124111334 |
6 | 30505441205 |
7 | 4465352435 |
oct | 1325027445 |
9 | 436571155 |
10 | 190066469 |
11 | 9831882a |
12 | 537a0205 |
13 | 304b9a88 |
14 | 1b3582c5 |
15 | 11a45ece |
hex | b542f25 |
190066469 has 2 divisors, whose sum is σ = 190066470. Its totient is φ = 190066468.
The previous prime is 190066417. The next prime is 190066483. The reversal of 190066469 is 964660091.
190066469 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 189750625 + 315844 = 13775^2 + 562^2 .
It is a cyclic number.
It is not a de Polignac number, because 190066469 - 28 = 190066213 is a prime.
It is a super-3 number, since 3×1900664693 (a number of 26 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (190066769) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 95033234 + 95033235.
It is an arithmetic number, because the mean of its divisors is an integer number (95033235).
Almost surely, 2190066469 is an apocalyptic number.
It is an amenable number.
190066469 is a deficient number, since it is larger than the sum of its proper divisors (1).
190066469 is an equidigital number, since it uses as much as digits as its factorization.
190066469 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 69984, while the sum is 41.
The square root of 190066469 is about 13786.4596252990. The cubic root of 190066469 is about 574.9567392784.
The spelling of 190066469 in words is "one hundred ninety million, sixty-six thousand, four hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.527 sec. • engine limits •