Base | Representation |
---|---|
bin | 1110101000110111100111… |
… | …0000001010011111110001 |
3 | 2002222200202002112210100001 |
4 | 3222031321300022133301 |
5 | 4102201120443032103 |
6 | 54122023311030001 |
7 | 3250563112153141 |
oct | 352157160123761 |
9 | 62880662483301 |
10 | 16095285127153 |
11 | 5145a7693a841 |
12 | 197b45a50b301 |
13 | 8c9a1825a45b |
14 | 3d9031adc921 |
15 | 1cda1e23101d |
hex | ea379c0a7f1 |
16095285127153 has 4 divisors (see below), whose sum is σ = 16218149899248. Its totient is φ = 15972420355060.
The previous prime is 16095285127123. The next prime is 16095285127193. The reversal of 16095285127153 is 35172158259061.
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 16095285127153 - 229 = 16094748256241 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 16095285127094 and 16095285127103.
It is not an unprimeable number, because it can be changed into a prime (16095285127123) 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, 61432385851 + ... + 61432386112.
It is an arithmetic number, because the mean of its divisors is an integer number (4054537474812).
Almost surely, 216095285127153 is an apocalyptic number.
It is an amenable number.
16095285127153 is a deficient number, since it is larger than the sum of its proper divisors (122864772095).
16095285127153 is a wasteful number, since it uses less digits than its factorization.
16095285127153 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 122864772094.
The product of its (nonzero) digits is 4536000, while the sum is 55.
The spelling of 16095285127153 in words is "sixteen trillion, ninety-five billion, two hundred eighty-five million, one hundred twenty-seven thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •