Base | Representation |
---|---|
bin | 10010010000001100… |
… | …101001101111001001 |
3 | 1212120220011200122122 |
4 | 102100030221233021 |
5 | 310114332324334 |
6 | 13000444501025 |
7 | 1262453433503 |
oct | 222014515711 |
9 | 55526150578 |
10 | 19599104969 |
11 | 8348202714 |
12 | 396b84a775 |
13 | 1b04611b42 |
14 | d3cd6ad73 |
15 | 79a97c32e |
hex | 490329bc9 |
19599104969 has 4 divisors (see below), whose sum is σ = 19599385344. Its totient is φ = 19598824596.
The previous prime is 19599104963. The next prime is 19599105011. The reversal of 19599104969 is 96940199591.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also a brilliant number, because the two primes have the same length, and also an emirpimes, since its reverse is a distinct semiprime: 96940199591 = 20899 ⋅4638509.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-19599104969 is a prime.
It is a super-2 number, since 2×195991049692 (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 (19599104963) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 59144 + ... + 206630.
It is an arithmetic number, because the mean of its divisors is an integer number (4899846336).
Almost surely, 219599104969 is an apocalyptic number.
It is an amenable number.
19599104969 is a deficient number, since it is larger than the sum of its proper divisors (280375).
19599104969 is a wasteful number, since it uses less digits than its factorization.
19599104969 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 280374.
The product of its (nonzero) digits is 7085880, while the sum is 62.
The spelling of 19599104969 in words is "nineteen billion, five hundred ninety-nine million, one hundred four thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •