Base | Representation |
---|---|
bin | 10010100110010001… |
… | …000000000111010001 |
3 | 1220112200211210001121 |
4 | 102212101000013101 |
5 | 311344123001303 |
6 | 13101312202241 |
7 | 1304600423446 |
oct | 224621000721 |
9 | 56480753047 |
10 | 19969343953 |
11 | 85181a0749 |
12 | 3a53839381 |
13 | 1b63233170 |
14 | d761c59cd |
15 | 7bd2129bd |
hex | 4a64401d1 |
19969343953 has 8 divisors (see below), whose sum is σ = 21515540648. Its totient is φ = 18424589184.
The previous prime is 19969343951. The next prime is 19969344013. The reversal of 19969343953 is 35934396991.
It can be written as a sum of positive squares in 4 ways, for example, as 4202021329 + 15767322624 = 64823^2 + 125568^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 19969343953 - 21 = 19969343951 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 19969343891 and 19969343900.
It is not an unprimeable number, because it can be changed into a prime (19969343951) 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, 331626 + ... + 387187.
It is an arithmetic number, because the mean of its divisors is an integer number (2689442581).
Almost surely, 219969343953 is an apocalyptic number.
19969343953 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
19969343953 is a deficient number, since it is larger than the sum of its proper divisors (1546196695).
19969343953 is a wasteful number, since it uses less digits than its factorization.
19969343953 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 720963.
The product of its digits is 21257640, while the sum is 61.
The spelling of 19969343953 in words is "nineteen billion, nine hundred sixty-nine million, three hundred forty-three thousand, nine hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •