Base | Representation |
---|---|
bin | 1110100110010000000101… |
… | …0001111001111110111101 |
3 | 2002211101122222220211222022 |
4 | 3221210001101321332331 |
5 | 4100432020422200232 |
6 | 54045225041125525 |
7 | 3244411515105425 |
oct | 351440121717675 |
9 | 62741588824868 |
10 | 16050314256317 |
11 | 5128999a6a990 |
12 | 19727a99298a5 |
13 | 8c56cc3a7b03 |
14 | 3d6ba7293485 |
15 | 1cc78b148812 |
hex | e9901479fbd |
16050314256317 has 4 divisors (see below), whose sum is σ = 17509433734176. Its totient is φ = 14591194778460.
The previous prime is 16050314256311. The next prime is 16050314256341. The reversal of 16050314256317 is 71365241305061.
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 16050314256317 - 210 = 16050314255293 is a prime.
It is a super-2 number, since 2×160503142563172 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16050314256311) 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, 729559738913 + ... + 729559738934.
It is an arithmetic number, because the mean of its divisors is an integer number (4377358433544).
Almost surely, 216050314256317 is an apocalyptic number.
It is an amenable number.
16050314256317 is a deficient number, since it is larger than the sum of its proper divisors (1459119477859).
16050314256317 is a wasteful number, since it uses less digits than its factorization.
16050314256317 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1459119477858.
The product of its (nonzero) digits is 453600, while the sum is 44.
The spelling of 16050314256317 in words is "sixteen trillion, fifty billion, three hundred fourteen million, two hundred fifty-six thousand, three hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •