Base | Representation |
---|---|
bin | 1111011011110001111011… |
… | …0000000001110000101101 |
3 | 2020002022100201100222101101 |
4 | 3312330132300001300231 |
5 | 4211013410003134401 |
6 | 100031513510243101 |
7 | 3401015504253262 |
oct | 366743660016055 |
9 | 66068321328341 |
10 | 16969931693101 |
11 | 54529a9043352 |
12 | 1aa0a77956491 |
13 | 9613471c3a7a |
14 | 4294c5c19269 |
15 | 1e6660a24101 |
hex | f6f1ec01c2d |
16969931693101 has 4 divisors (see below), whose sum is σ = 16969947278400. Its totient is φ = 16969916107804.
The previous prime is 16969931693087. The next prime is 16969931693149. The reversal of 16969931693101 is 10139613996961.
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 16969931693101 - 235 = 16935571954733 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16969931693191) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6025861 + ... + 8381578.
It is an arithmetic number, because the mean of its divisors is an integer number (4242486819600).
Almost surely, 216969931693101 is an apocalyptic number.
It is an amenable number.
16969931693101 is a deficient number, since it is larger than the sum of its proper divisors (15585299).
16969931693101 is a wasteful number, since it uses less digits than its factorization.
16969931693101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15585298.
The product of its (nonzero) digits is 12754584, while the sum is 64.
The spelling of 16969931693101 in words is "sixteen trillion, nine hundred sixty-nine billion, nine hundred thirty-one million, six hundred ninety-three thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •