Base | Representation |
---|---|
bin | 10100100010100100110… |
… | …000100010110100101101 |
3 | 11222221100210121021020122 |
4 | 110202210300202310231 |
5 | 141111234421241221 |
6 | 3000235040054325 |
7 | 203656422315563 |
oct | 24424460426455 |
9 | 4887323537218 |
10 | 1411513462061 |
11 | 4a468a60779a |
12 | 1a96890043a5 |
13 | a314a01ac11 |
14 | 4c463777a33 |
15 | 26ab3d25eab |
hex | 148a4c22d2d |
1411513462061 has 4 divisors (see below), whose sum is σ = 1411612231932. Its totient is φ = 1411414692192.
The previous prime is 1411513462039. The next prime is 1411513462063. The reversal of 1411513462061 is 1602643151141.
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 61050997225 + 1350462464836 = 247085^2 + 1162094^2 .
It is a cyclic number.
It is not a de Polignac number, because 1411513462061 - 210 = 1411513461037 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 (1411513462063) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 49363496 + ... + 49392081.
It is an arithmetic number, because the mean of its divisors is an integer number (352903057983).
Almost surely, 21411513462061 is an apocalyptic number.
It is an amenable number.
1411513462061 is a deficient number, since it is larger than the sum of its proper divisors (98769871).
1411513462061 is an equidigital number, since it uses as much as digits as its factorization.
1411513462061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 98769870.
The product of its (nonzero) digits is 17280, while the sum is 35.
The spelling of 1411513462061 in words is "one trillion, four hundred eleven billion, five hundred thirteen million, four hundred sixty-two thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •