Base | Representation |
---|---|
bin | 1011000101101000110… |
… | …1110000000011000001 |
3 | 200012200201112002102121 |
4 | 2301122031300003001 |
5 | 11110111440141022 |
6 | 223302203044241 |
7 | 16522400156032 |
oct | 2613215600301 |
9 | 605621462377 |
10 | 190492115137 |
11 | 73872918615 |
12 | 30b03510681 |
13 | 14c6a585bbc |
14 | 9311460a89 |
15 | 4e4d8c32c7 |
hex | 2c5a3700c1 |
190492115137 has 8 divisors (see below), whose sum is σ = 190809711936. Its totient is φ = 190174591152.
The previous prime is 190492115111. The next prime is 190492115159. The reversal of 190492115137 is 731511294091.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-190492115137 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 190492115093 and 190492115102.
It is not an unprimeable number, because it can be changed into a prime (190492115167) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 8304438 + ... + 8327344.
It is an arithmetic number, because the mean of its divisors is an integer number (23851213992).
Almost surely, 2190492115137 is an apocalyptic number.
It is an amenable number.
190492115137 is a deficient number, since it is larger than the sum of its proper divisors (317596799).
190492115137 is a wasteful number, since it uses less digits than its factorization.
190492115137 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36407.
The product of its (nonzero) digits is 68040, while the sum is 43.
The spelling of 190492115137 in words is "one hundred ninety billion, four hundred ninety-two million, one hundred fifteen thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •