Base | Representation |
---|---|
bin | 1011000101011110111… |
… | …1111010101001110111 |
3 | 200012120211200000011212 |
4 | 2301113233322221313 |
5 | 11110020342133311 |
6 | 223254124152035 |
7 | 16521355402232 |
oct | 2612757725167 |
9 | 605524600155 |
10 | 190450739831 |
11 | 73851528750 |
12 | 30ab169861b |
13 | 14c61b2a381 |
14 | 9309b70419 |
15 | 4e49e4dc8b |
hex | 2c57bfaa77 |
190450739831 has 16 divisors (see below), whose sum is σ = 218974008960. Its totient is φ = 163818614880.
The previous prime is 190450739821. The next prime is 190450739837. The reversal of 190450739831 is 138937054091.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-190450739831 is a prime.
It is a super-3 number, since 3×1904507398313 (a number of 35 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a self number, because there is not a number n which added to its sum of digits gives 190450739831.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (190450739837) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 405101 + ... + 738246.
It is an arithmetic number, because the mean of its divisors is an integer number (13685875560).
Almost surely, 2190450739831 is an apocalyptic number.
190450739831 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
190450739831 is a deficient number, since it is larger than the sum of its proper divisors (28523269129).
190450739831 is a wasteful number, since it uses less digits than its factorization.
190450739831 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1144174.
The product of its (nonzero) digits is 816480, while the sum is 50.
The spelling of 190450739831 in words is "one hundred ninety billion, four hundred fifty million, seven hundred thirty-nine thousand, eight hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •