Base | Representation |
---|---|
bin | 1110110110000011111100… |
… | …1101010110101111111011 |
3 | 2010210100202210111202201012 |
4 | 3231200333031112233323 |
5 | 4114404311131043314 |
6 | 54414105521544135 |
7 | 3303135536335154 |
oct | 355407715265773 |
9 | 63710683452635 |
10 | 16321936190459 |
11 | 5223104516299 |
12 | 19b73734a504b |
13 | 9151c8b86c73 |
14 | 405db355092b |
15 | 1d48872b193e |
hex | ed83f356bfb |
16321936190459 has 8 divisors (see below), whose sum is σ = 16568955096000. Its totient is φ = 16075927588032.
The previous prime is 16321936190447. The next prime is 16321936190473. The reversal of 16321936190459 is 95409163912361.
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 16321936190459 - 212 = 16321936186363 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 16321936190398 and 16321936190407.
It is not an unprimeable number, because it can be changed into a prime (16321936990459) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 252543224 + ... + 252607845.
It is an arithmetic number, because the mean of its divisors is an integer number (2071119387000).
Almost surely, 216321936190459 is an apocalyptic number.
16321936190459 is a deficient number, since it is larger than the sum of its proper divisors (247018905541).
16321936190459 is an equidigital number, since it uses as much as digits as its factorization.
16321936190459 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 505151557.
The product of its (nonzero) digits is 9447840, while the sum is 59.
The spelling of 16321936190459 in words is "sixteen trillion, three hundred twenty-one billion, nine hundred thirty-six million, one hundred ninety thousand, four hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •