Base | Representation |
---|---|
bin | 1110100011111100100000… |
… | …1001110001011110000001 |
3 | 2002200121102021210212222212 |
4 | 3220333020021301132001 |
5 | 4044304403441223223 |
6 | 54015114202111505 |
7 | 3241510046014310 |
oct | 350771011613601 |
9 | 62617367725885 |
10 | 16010701117313 |
11 | 5113111423281 |
12 | 1966b934ab595 |
13 | 8c1a585165a6 |
14 | 3d4cca22a277 |
15 | 1cb71d5cc278 |
hex | e8fc8271781 |
16010701117313 has 8 divisors (see below), whose sum is σ = 18297976906560. Its totient is φ = 13723433521200.
The previous prime is 16010701117297. The next prime is 16010701117337. The reversal of 16010701117313 is 31371110701061.
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 16010701117313 - 24 = 16010701117297 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 16010701117313.
It is not an unprimeable number, because it can be changed into a prime (16010701117363) 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, 2953478 + ... + 6383136.
It is an arithmetic number, because the mean of its divisors is an integer number (2287247113320).
Almost surely, 216010701117313 is an apocalyptic number.
It is an amenable number.
16010701117313 is a deficient number, since it is larger than the sum of its proper divisors (2287275789247).
16010701117313 is an equidigital number, since it uses as much as digits as its factorization.
16010701117313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4096567.
The product of its (nonzero) digits is 2646, while the sum is 32.
Adding to 16010701117313 its reverse (31371110701061), we get a palindrome (47381811818374).
The spelling of 16010701117313 in words is "sixteen trillion, ten billion, seven hundred one million, one hundred seventeen thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •