Base | Representation |
---|---|
bin | 1011000100110000111… |
… | …0011000001101100101 |
3 | 200012002100212020220121 |
4 | 2301030032120031211 |
5 | 11104121343224004 |
6 | 223223020201541 |
7 | 16513520130244 |
oct | 2611416301545 |
9 | 605070766817 |
10 | 190257398629 |
11 | 73762383631 |
12 | 30a589992b1 |
13 | 14c30a64bac |
14 | 92cc20295b |
15 | 4e37eac854 |
hex | 2c4c398365 |
190257398629 has 2 divisors, whose sum is σ = 190257398630. Its totient is φ = 190257398628.
The previous prime is 190257398627. The next prime is 190257398677. The reversal of 190257398629 is 926893752091.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 158720966404 + 31536432225 = 398398^2 + 177585^2 .
It is a cyclic number.
It is not a de Polignac number, because 190257398629 - 21 = 190257398627 is a prime.
It is a super-2 number, since 2×1902573986292 (a number of 23 digits) contains 22 as substring.
Together with 190257398627, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (190257398623) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 95128699314 + 95128699315.
It is an arithmetic number, because the mean of its divisors is an integer number (95128699315).
Almost surely, 2190257398629 is an apocalyptic number.
It is an amenable number.
190257398629 is a deficient number, since it is larger than the sum of its proper divisors (1).
190257398629 is an equidigital number, since it uses as much as digits as its factorization.
190257398629 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 14696640, while the sum is 61.
The spelling of 190257398629 in words is "one hundred ninety billion, two hundred fifty-seven million, three hundred ninety-eight thousand, six hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •