Base | Representation |
---|---|
bin | 1110110011010101010101… |
… | …1111000001001010100101 |
3 | 2010121212210021121202210202 |
4 | 3230311111133001022211 |
5 | 4113122313202413031 |
6 | 54340354535400245 |
7 | 3266556201222014 |
oct | 354652537011245 |
9 | 63555707552722 |
10 | 16275065279141 |
11 | 5205242072949 |
12 | 19aa272523085 |
13 | 910969488506 |
14 | 403a0862aa7b |
15 | 1d35424ae2cb |
hex | ecd557c12a5 |
16275065279141 has 4 divisors (see below), whose sum is σ = 16275268800000. Its totient is φ = 16274861758284.
The previous prime is 16275065279131. The next prime is 16275065279183. The reversal of 16275065279141 is 14197256057261.
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 16275065279141 - 230 = 16273991537317 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 (16275065279111) 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, 101640431 + ... + 101800428.
It is an arithmetic number, because the mean of its divisors is an integer number (4068817200000).
Almost surely, 216275065279141 is an apocalyptic number.
It is an amenable number.
16275065279141 is a deficient number, since it is larger than the sum of its proper divisors (203520859).
16275065279141 is an equidigital number, since it uses as much as digits as its factorization.
16275065279141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 203520858.
The product of its (nonzero) digits is 6350400, while the sum is 56.
The spelling of 16275065279141 in words is "sixteen trillion, two hundred seventy-five billion, sixty-five million, two hundred seventy-nine thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •