Base | Representation |
---|---|
bin | 10010001010011110… |
… | …100001011001110011 |
3 | 1212100012120110102212 |
4 | 102022132201121303 |
5 | 304420300014011 |
6 | 12543135402335 |
7 | 1260206560016 |
oct | 221236413163 |
9 | 55305513385 |
10 | 19503126131 |
11 | 82a9008365 |
12 | 39436833ab |
13 | 1aba778728 |
14 | d3030537d |
15 | 79231e08b |
hex | 48a7a1673 |
19503126131 has 16 divisors (see below), whose sum is σ = 20263507968. Its totient is φ = 18751219200.
The previous prime is 19503126089. The next prime is 19503126151. The reversal of 19503126131 is 13162130591.
It is a cyclic number.
It is not a de Polignac number, because 19503126131 - 218 = 19502863987 is a prime.
It is a super-2 number, since 2×195031261312 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (19503126151) 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 in 15 ways as a sum of consecutive naturals, for example, 5783876 + ... + 5787246.
It is an arithmetic number, because the mean of its divisors is an integer number (1266469248).
Almost surely, 219503126131 is an apocalyptic number.
19503126131 is a deficient number, since it is larger than the sum of its proper divisors (760381837).
19503126131 is a wasteful number, since it uses less digits than its factorization.
19503126131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4562.
The product of its (nonzero) digits is 4860, while the sum is 32.
The spelling of 19503126131 in words is "nineteen billion, five hundred three million, one hundred twenty-six thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.383 sec. • engine limits •