Base | Representation |
---|---|
bin | 10010010101110110… |
… | …110000001011011001 |
3 | 1212211111210020212020 |
4 | 102111312300023121 |
5 | 310313132334411 |
6 | 13014115205053 |
7 | 1265015320512 |
oct | 222566601331 |
9 | 55744706766 |
10 | 19694027481 |
11 | 8396846377 |
12 | 39975a6789 |
13 | 1b1b1984cb |
14 | d4b7d9a09 |
15 | 7a3e7c606 |
hex | 495db02d9 |
19694027481 has 16 divisors (see below), whose sum is σ = 26983081344. Its totient is φ = 12767549184.
The previous prime is 19694027443. The next prime is 19694027491. The reversal of 19694027481 is 18472049691.
It is not a de Polignac number, because 19694027481 - 229 = 19157156569 is a prime.
It is a super-2 number, since 2×196940274812 (a number of 21 digits) contains 22 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (19694027401) 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, 160540 + ... + 255266.
It is an arithmetic number, because the mean of its divisors is an integer number (1686442584).
Almost surely, 219694027481 is an apocalyptic number.
It is an amenable number.
19694027481 is a deficient number, since it is larger than the sum of its proper divisors (7289053863).
19694027481 is a wasteful number, since it uses less digits than its factorization.
19694027481 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 96640.
The product of its (nonzero) digits is 870912, while the sum is 51.
The spelling of 19694027481 in words is "nineteen billion, six hundred ninety-four million, twenty-seven thousand, four hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •