Base | Representation |
---|---|
bin | 1110101001100010001001… |
… | …1100101110011111011111 |
3 | 2010000210012222122111001012 |
4 | 3222120202130232133133 |
5 | 4102343013030101212 |
6 | 54131152425205435 |
7 | 3251446113153611 |
oct | 352304234563737 |
9 | 63023188574035 |
10 | 16106705315807 |
11 | 514a8a7282587 |
12 | 198170703087b |
13 | 8cab18244632 |
14 | 3d97d670adb1 |
15 | 1cde8bb20922 |
hex | ea62272e7df |
16106705315807 has 8 divisors (see below), whose sum is σ = 17054235058896. Its totient is φ = 15159184071552.
The previous prime is 16106705315717. The next prime is 16106705315837. The reversal of 16106705315807 is 70851350760161.
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 16106705315807 - 226 = 16106638206943 is a prime.
It is a super-2 number, since 2×161067053158072 (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 (16106705315837) 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, 2006648 + ... + 6019970.
It is an arithmetic number, because the mean of its divisors is an integer number (2131779382362).
Almost surely, 216106705315807 is an apocalyptic number.
16106705315807 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
16106705315807 is a deficient number, since it is larger than the sum of its proper divisors (947529743089).
16106705315807 is a wasteful number, since it uses less digits than its factorization.
16106705315807 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4249417.
The product of its (nonzero) digits is 1058400, while the sum is 50.
The spelling of 16106705315807 in words is "sixteen trillion, one hundred six billion, seven hundred five million, three hundred fifteen thousand, eight hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •