Base | Representation |
---|---|
bin | 10010010001100100… |
… | …000100111000100011 |
3 | 1212122111022000212011 |
4 | 102101210010320203 |
5 | 310141214211231 |
6 | 13003024013351 |
7 | 1263152304145 |
oct | 222144047043 |
9 | 55574260764 |
10 | 19622022691 |
11 | 835a136087 |
12 | 3977461257 |
13 | 1b092a731b |
14 | d42014c95 |
15 | 79c9a79b1 |
hex | 491904e23 |
19622022691 has 4 divisors (see below), whose sum is σ = 19765249272. Its totient is φ = 19478796112.
The previous prime is 19622022689. The next prime is 19622022697.
19622022691 is nontrivially palindromic in base 10.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 19622022691 - 21 = 19622022689 is a prime.
It is a super-2 number, since 2×196220226912 (a number of 21 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (40) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (19622022697) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 71613085 + ... + 71613358.
It is an arithmetic number, because the mean of its divisors is an integer number (4941312318).
Almost surely, 219622022691 is an apocalyptic number.
19622022691 is a deficient number, since it is larger than the sum of its proper divisors (143226581).
19622022691 is a wasteful number, since it uses less digits than its factorization.
19622022691 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 143226580.
The product of its (nonzero) digits is 46656, while the sum is 40.
The spelling of 19622022691 in words is "nineteen billion, six hundred twenty-two million, twenty-two thousand, six hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •