Base | Representation |
---|---|
bin | 10010100101110110… |
… | …000101101000011101 |
3 | 1220112012120100000210 |
4 | 102211312011220131 |
5 | 311340321214134 |
6 | 13100501043033 |
7 | 1304453440221 |
oct | 224566055035 |
9 | 56465510023 |
10 | 19962288669 |
11 | 8514211a34 |
12 | 3a513b6479 |
13 | 1b61932a3b |
14 | d752aa781 |
15 | 7bc7bc2e9 |
hex | 4a5d85a1d |
19962288669 has 8 divisors (see below), whose sum is σ = 27013644640. Its totient is φ = 13109562576.
The previous prime is 19962288659. The next prime is 19962288679. The reversal of 19962288669 is 96688226991.
It is an interprime number because it is at equal distance from previous prime (19962288659) and next prime (19962288679).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 19962288669 - 28 = 19962288413 is a prime.
It is a super-2 number, since 2×199622886692 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (19962288629) 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 7 ways as a sum of consecutive naturals, for example, 49657234 + ... + 49657635.
It is an arithmetic number, because the mean of its divisors is an integer number (3376705580).
Almost surely, 219962288669 is an apocalyptic number.
It is an amenable number.
19962288669 is a deficient number, since it is larger than the sum of its proper divisors (7051355971).
19962288669 is an equidigital number, since it uses as much as digits as its factorization.
19962288669 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 99314939.
The product of its digits is 40310784, while the sum is 66.
The spelling of 19962288669 in words is "nineteen billion, nine hundred sixty-two million, two hundred eighty-eight thousand, six hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •