Base | Representation |
---|---|
bin | 10100100110110010101… |
… | …001001100111001001001 |
3 | 12000101001100200121120102 |
4 | 110212302221030321021 |
5 | 141200023043314140 |
6 | 3002304225135145 |
7 | 204206553115643 |
oct | 24466251147111 |
9 | 5011040617512 |
10 | 1416041385545 |
11 | 4a65a349a716 |
12 | 1aa53148a4b5 |
13 | a36bc120497 |
14 | 4c772c71893 |
15 | 26c7b5cce15 |
hex | 149b2a4ce49 |
1416041385545 has 4 divisors (see below), whose sum is σ = 1699249662660. Its totient is φ = 1132833108432.
The previous prime is 1416041385443. The next prime is 1416041385607. The reversal of 1416041385545 is 5455831406141.
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 182011450384 + 1234029935161 = 426628^2 + 1110869^2 .
It is a cyclic number.
It is not a de Polignac number, because 1416041385545 - 230 = 1414967643721 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1416041385545.
It is an unprimeable number.
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, 141604138550 + ... + 141604138559.
It is an arithmetic number, because the mean of its divisors is an integer number (424812415665).
Almost surely, 21416041385545 is an apocalyptic number.
It is an amenable number.
1416041385545 is a deficient number, since it is larger than the sum of its proper divisors (283208277115).
1416041385545 is an equidigital number, since it uses as much as digits as its factorization.
1416041385545 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 283208277114.
The product of its (nonzero) digits is 1152000, while the sum is 47.
The spelling of 1416041385545 in words is "one trillion, four hundred sixteen billion, forty-one million, three hundred eighty-five thousand, five hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •