Base | Representation |
---|---|
bin | 10100100010001110101… |
… | …111010010010100001101 |
3 | 11222220102001110100121011 |
4 | 110202032233102110031 |
5 | 141110010333033144 |
6 | 3000134242005221 |
7 | 203644315242535 |
oct | 24421657222415 |
9 | 4886361410534 |
10 | 1411144033549 |
11 | 4a4510022678 |
12 | 1a95a5346811 |
13 | a30bb621773 |
14 | 4c42a6904c5 |
15 | 26a916a0a34 |
hex | 1488ebd250d |
1411144033549 has 4 divisors (see below), whose sum is σ = 1432205884864. Its totient is φ = 1390082182236.
The previous prime is 1411144033493. The next prime is 1411144033573. The reversal of 1411144033549 is 9453304411141.
It is a happy number.
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 a de Polignac number, because none of the positive numbers 2k-1411144033549 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 (1411144033589) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 10530925557 + ... + 10530925690.
It is an arithmetic number, because the mean of its divisors is an integer number (358051471216).
Almost surely, 21411144033549 is an apocalyptic number.
It is an amenable number.
1411144033549 is a deficient number, since it is larger than the sum of its proper divisors (21061851315).
1411144033549 is an equidigital number, since it uses as much as digits as its factorization.
1411144033549 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21061851314.
The product of its (nonzero) digits is 103680, while the sum is 40.
The spelling of 1411144033549 in words is "one trillion, four hundred eleven billion, one hundred forty-four million, thirty-three thousand, five hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •