Base | Representation |
---|---|
bin | 1000110111101101011011… |
… | …11110011010000010100001 |
3 | 2120001210100010200222221201 |
4 | 10123312231332122002201 |
5 | 10024043014004342324 |
6 | 105253033413321201 |
7 | 4052200626255541 |
oct | 433665576320241 |
9 | 76053303628851 |
10 | 19506365309089 |
11 | 624066a76156a |
12 | 223056a336201 |
13 | ab6599b18159 |
14 | 4b618257b321 |
15 | 23c612e9a444 |
hex | 11bdadf9a0a1 |
19506365309089 has 4 divisors (see below), whose sum is σ = 19836981670320. Its totient is φ = 19175748947860.
The previous prime is 19506365309087. The next prime is 19506365309131. The reversal of 19506365309089 is 98090356360591.
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.
It is a cyclic number.
It is not a de Polignac number, because 19506365309089 - 21 = 19506365309087 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 19506365309089.
It is not an unprimeable number, because it can be changed into a prime (19506365309087) 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, 165308180527 + ... + 165308180644.
It is an arithmetic number, because the mean of its divisors is an integer number (4959245417580).
Almost surely, 219506365309089 is an apocalyptic number.
It is an amenable number.
19506365309089 is a deficient number, since it is larger than the sum of its proper divisors (330616361231).
19506365309089 is an equidigital number, since it uses as much as digits as its factorization.
19506365309089 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 330616361230.
The product of its (nonzero) digits is 47239200, while the sum is 64.
The spelling of 19506365309089 in words is "nineteen trillion, five hundred six billion, three hundred sixty-five million, three hundred nine thousand, eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •