Base | Representation |
---|---|
bin | 1111011000111010111000… |
… | …1100100000100001101001 |
3 | 2012220121112112221222200201 |
4 | 3312032232030200201221 |
5 | 4204212243431142411 |
6 | 55553150235432201 |
7 | 3364326110535364 |
oct | 366165614404151 |
9 | 65817475858621 |
10 | 16920798693481 |
11 | 5434085813541 |
12 | 1a934452b5661 |
13 | 959816c65327 |
14 | 426d846d50db |
15 | 1e523733d3c1 |
hex | f63ae320869 |
16920798693481 has 4 divisors (see below), whose sum is σ = 16996676714752. Its totient is φ = 16844920672212.
The previous prime is 16920798693467. The next prime is 16920798693499. The reversal of 16920798693481 is 18439689702961.
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 16920798693481 - 219 = 16920798169193 is a prime.
It is a super-2 number, since 2×169207986934812 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (16920798693401) 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, 37939010301 + ... + 37939010746.
It is an arithmetic number, because the mean of its divisors is an integer number (4249169178688).
Almost surely, 216920798693481 is an apocalyptic number.
It is an amenable number.
16920798693481 is a deficient number, since it is larger than the sum of its proper divisors (75878021271).
16920798693481 is an equidigital number, since it uses as much as digits as its factorization.
16920798693481 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 75878021270.
The product of its (nonzero) digits is 282175488, while the sum is 73.
The spelling of 16920798693481 in words is "sixteen trillion, nine hundred twenty billion, seven hundred ninety-eight million, six hundred ninety-three thousand, four hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •