Base | Representation |
---|---|
bin | 10010011001100101… |
… | …111010000011011101 |
3 | 1212222212202101022022 |
4 | 102121211322003131 |
5 | 310430210022344 |
6 | 13024235025525 |
7 | 1266406231532 |
oct | 223145720335 |
9 | 55885671268 |
10 | 19756720349 |
11 | 8419176463 |
12 | 39b459b2a5 |
13 | 1b2b179092 |
14 | d55c78d89 |
15 | 7a97130ee |
hex | 49997a0dd |
19756720349 has 4 divisors (see below), whose sum is σ = 19757576064. Its totient is φ = 19755864636.
The previous prime is 19756720309. The next prime is 19756720367. The reversal of 19756720349 is 94302765791.
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 an emirpimes, since its reverse is a distinct semiprime: 94302765791 = 13 ⋅7254058907.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-19756720349 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 19756720349.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (19756720309) 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, 392237 + ... + 439730.
It is an arithmetic number, because the mean of its divisors is an integer number (4939394016).
Almost surely, 219756720349 is an apocalyptic number.
It is an amenable number.
19756720349 is a deficient number, since it is larger than the sum of its proper divisors (855715).
19756720349 is an equidigital number, since it uses as much as digits as its factorization.
19756720349 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 855714.
The product of its (nonzero) digits is 2857680, while the sum is 53.
The spelling of 19756720349 in words is "nineteen billion, seven hundred fifty-six million, seven hundred twenty thousand, three hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •