Base | Representation |
---|---|
bin | 1011000100100000110… |
… | …1111110110111011111 |
3 | 200011220200101111110011 |
4 | 2301020031332313133 |
5 | 11104002141422301 |
6 | 223212215424051 |
7 | 16512042623023 |
oct | 2611015766737 |
9 | 604820344404 |
10 | 190190185951 |
11 | 73728446767 |
12 | 30a3a385027 |
13 | 14c1cb60c8c |
14 | 92c3308383 |
15 | 4e32132a51 |
hex | 2c4837eddf |
190190185951 has 2 divisors, whose sum is σ = 190190185952. Its totient is φ = 190190185950.
The previous prime is 190190185921. The next prime is 190190186009. The reversal of 190190185951 is 159581091091.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 190190185951 - 221 = 190188088799 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 190190185895 and 190190185904.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (190190185921) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 95095092975 + 95095092976.
It is an arithmetic number, because the mean of its divisors is an integer number (95095092976).
Almost surely, 2190190185951 is an apocalyptic number.
190190185951 is a deficient number, since it is larger than the sum of its proper divisors (1).
190190185951 is an equidigital number, since it uses as much as digits as its factorization.
190190185951 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 145800, while the sum is 49.
The spelling of 190190185951 in words is "one hundred ninety billion, one hundred ninety million, one hundred eighty-five thousand, nine hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •