Base | Representation |
---|---|
bin | 1011000100110010110… |
… | …0011001001011100111 |
3 | 200012002220200000011202 |
4 | 2301030230121023213 |
5 | 11104130402020134 |
6 | 223223500553115 |
7 | 16513644041000 |
oct | 2611454311347 |
9 | 605086600152 |
10 | 190265266919 |
11 | 73766868152 |
12 | 30a5b55279b |
13 | 14c3258b3a0 |
14 | 92cd2901a7 |
15 | 4e38a13d7e |
hex | 2c4cb192e7 |
190265266919 has 32 divisors (see below), whose sum is σ = 239301350400. Its totient is φ = 150319260000.
The previous prime is 190265266811. The next prime is 190265266949. The reversal of 190265266919 is 919662562091.
It is a happy number.
190265266919 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 190265266919 - 216 = 190265201383 is a prime.
It is a super-2 number, since 2×1902652669192 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (190265266949) 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 in 31 ways as a sum of consecutive naturals, for example, 3050294 + ... + 3112044.
It is an arithmetic number, because the mean of its divisors is an integer number (7478167200).
Almost surely, 2190265266919 is an apocalyptic number.
190265266919 is a deficient number, since it is larger than the sum of its proper divisors (49036083481).
190265266919 is an equidigital number, since it uses as much as digits as its factorization.
190265266919 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 62476 (or 62462 counting only the distinct ones).
The product of its (nonzero) digits is 3149280, while the sum is 56.
The spelling of 190265266919 in words is "one hundred ninety billion, two hundred sixty-five million, two hundred sixty-six thousand, nine hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •