Base | Representation |
---|---|
bin | 1011000101100001100… |
… | …1001111001001101011 |
3 | 200012121121001022200212 |
4 | 2301120121033021223 |
5 | 11110031130243231 |
6 | 223255152251335 |
7 | 16521546435056 |
oct | 2613031171153 |
9 | 605547038625 |
10 | 190461571691 |
11 | 738576568a6 |
12 | 30ab5240b4b |
13 | 14c64150761 |
14 | 930b38da9d |
15 | 4e4ad8d42b |
hex | 2c5864f26b |
190461571691 has 2 divisors, whose sum is σ = 190461571692. Its totient is φ = 190461571690.
The previous prime is 190461571679. The next prime is 190461571759. The reversal of 190461571691 is 196175164091.
190461571691 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is an emirp because it is prime and its reverse (196175164091) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 190461571691 - 218 = 190461309547 is a prime.
It is a super-2 number, since 2×1904615716912 (a number of 23 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is not a weakly prime, because it can be changed into another prime (190461573691) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 95230785845 + 95230785846.
It is an arithmetic number, because the mean of its divisors is an integer number (95230785846).
Almost surely, 2190461571691 is an apocalyptic number.
190461571691 is a deficient number, since it is larger than the sum of its proper divisors (1).
190461571691 is an equidigital number, since it uses as much as digits as its factorization.
190461571691 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 408240, while the sum is 50.
The spelling of 190461571691 in words is "one hundred ninety billion, four hundred sixty-one million, five hundred seventy-one thousand, six hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •