Base | Representation |
---|---|
bin | 11101111110110100… |
… | …00111100110010101 |
3 | 1112112202211112021221 |
4 | 32333122013212111 |
5 | 230431111301023 |
6 | 11221113210341 |
7 | 1106610263041 |
oct | 167732074625 |
9 | 45482745257 |
10 | 16096197013 |
11 | 690a97a066 |
12 | 31527009b1 |
13 | 1696997a40 |
14 | ac9a53021 |
15 | 64319885d |
hex | 3bf687995 |
16096197013 has 4 divisors (see below), whose sum is σ = 17334366028. Its totient is φ = 14858028000.
The previous prime is 16096196983. The next prime is 16096197059. The reversal of 16096197013 is 31079169061.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 31079169061 = 48869 ⋅635969.
It can be written as a sum of positive squares in 2 ways, for example, as 2007219204 + 14088977809 = 44802^2 + 118697^2 .
It is a cyclic number.
It is not a de Polignac number, because 16096197013 - 225 = 16062642581 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 (16096197413) 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, 619084488 + ... + 619084513.
It is an arithmetic number, because the mean of its divisors is an integer number (4333591507).
Almost surely, 216096197013 is an apocalyptic number.
16096197013 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
16096197013 is a deficient number, since it is larger than the sum of its proper divisors (1238169015).
16096197013 is a wasteful number, since it uses less digits than its factorization.
16096197013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1238169014.
The product of its (nonzero) digits is 61236, while the sum is 43.
The spelling of 16096197013 in words is "sixteen billion, ninety-six million, one hundred ninety-seven thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •