Base | Representation |
---|---|
bin | 11010110101111111… |
… | …01010111001110101 |
3 | 1101012100212012020202 |
4 | 31122333222321311 |
5 | 214003323322013 |
6 | 10342013210245 |
7 | 1020063041552 |
oct | 153277527165 |
9 | 41170765222 |
10 | 14411542133 |
11 | 6125a379aa |
12 | 2962490985 |
13 | 1488961c31 |
14 | 9aa003a29 |
15 | 595326858 |
hex | 35afeae75 |
14411542133 has 4 divisors (see below), whose sum is σ = 14452836300. Its totient is φ = 14370247968.
The previous prime is 14411542109. The next prime is 14411542153. The reversal of 14411542133 is 33124511441.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 12308127364 + 2103414769 = 110942^2 + 45863^2 .
It is a cyclic number.
It is not a de Polignac number, because 14411542133 - 218 = 14411279989 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 14411542096 and 14411542105.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14411542153) 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, 20646560 + ... + 20647257.
It is an arithmetic number, because the mean of its divisors is an integer number (3613209075).
Almost surely, 214411542133 is an apocalyptic number.
It is an amenable number.
14411542133 is a deficient number, since it is larger than the sum of its proper divisors (41294167).
14411542133 is an equidigital number, since it uses as much as digits as its factorization.
14411542133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41294166.
The product of its digits is 5760, while the sum is 29.
The spelling of 14411542133 in words is "fourteen billion, four hundred eleven million, five hundred forty-two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •