Base | Representation |
---|---|
bin | 1111001100111001011111… |
… | …0111110100100000101001 |
3 | 2012011212102220202221122101 |
4 | 3303032113313310200221 |
5 | 4142321304012210403 |
6 | 55314232213453401 |
7 | 3343365041443615 |
oct | 363162767644051 |
9 | 65155386687571 |
10 | 16714265741353 |
11 | 53645312a8754 |
12 | 1a5b405941261 |
13 | 9431c132870b |
14 | 41ad90b12345 |
15 | 1deb9a5a971d |
hex | f3397df4829 |
16714265741353 has 4 divisors (see below), whose sum is σ = 16789217605888. Its totient is φ = 16639313876820.
The previous prime is 16714265741351. The next prime is 16714265741413. The reversal of 16714265741353 is 35314756241761.
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 16714265741353 - 21 = 16714265741351 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 16714265741294 and 16714265741303.
It is not an unprimeable number, because it can be changed into a prime (16714265741351) 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, 37475931933 + ... + 37475932378.
It is an arithmetic number, because the mean of its divisors is an integer number (4197304401472).
Almost surely, 216714265741353 is an apocalyptic number.
It is an amenable number.
16714265741353 is a deficient number, since it is larger than the sum of its proper divisors (74951864535).
16714265741353 is an equidigital number, since it uses as much as digits as its factorization.
16714265741353 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 74951864534.
The product of its digits is 12700800, while the sum is 55.
The spelling of 16714265741353 in words is "sixteen trillion, seven hundred fourteen billion, two hundred sixty-five million, seven hundred forty-one thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •