Base | Representation |
---|---|
bin | 10010010101111111… |
… | …011110101010010101 |
3 | 1212211200002110210020 |
4 | 102111333132222111 |
5 | 310314224040104 |
6 | 13014240215353 |
7 | 1265043625656 |
oct | 222577365225 |
9 | 55750073706 |
10 | 19696315029 |
11 | 8398069006 |
12 | 399830a559 |
13 | 1b1b7b97a1 |
14 | d4bc3352d |
15 | 7a42802d9 |
hex | 495fdea95 |
19696315029 has 8 divisors (see below), whose sum is σ = 27403568832. Its totient is φ = 12559968960.
The previous prime is 19696315019. The next prime is 19696315061. The reversal of 19696315029 is 92051369691.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 19696315029 - 28 = 19696314773 is a prime.
It is a super-3 number, since 3×196963150293 (a number of 32 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (19696315019) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 142726852 + ... + 142726989.
It is an arithmetic number, because the mean of its divisors is an integer number (3425446104).
Almost surely, 219696315029 is an apocalyptic number.
It is an amenable number.
19696315029 is a deficient number, since it is larger than the sum of its proper divisors (7707253803).
19696315029 is a wasteful number, since it uses less digits than its factorization.
19696315029 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 285453867.
The product of its (nonzero) digits is 787320, while the sum is 51.
The spelling of 19696315029 in words is "nineteen billion, six hundred ninety-six million, three hundred fifteen thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •