Base | Representation |
---|---|
bin | 100011001000011100001… |
… | …111110111001001111101 |
3 | 22112210120220220122202011 |
4 | 203020130033313021331 |
5 | 304023333324243402 |
6 | 5045031124331221 |
7 | 336265153334041 |
oct | 43103417671175 |
9 | 8483526818664 |
10 | 2414245540477 |
11 | 85096a739631 |
12 | 32ba91b43b11 |
13 | 14687c3221b4 |
14 | 84bc89a4021 |
15 | 42c0035bed7 |
hex | 2321c3f727d |
2414245540477 has 2 divisors, whose sum is σ = 2414245540478. Its totient is φ = 2414245540476.
The previous prime is 2414245540403. The next prime is 2414245540549. The reversal of 2414245540477 is 7740455424142.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2410656811641 + 3588728836 = 1552629^2 + 59906^2 .
It is a cyclic number.
It is not a de Polignac number, because 2414245540477 - 231 = 2412098056829 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2414245540477.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2414242540477) 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 as a sum of consecutive naturals, namely, 1207122770238 + 1207122770239.
It is an arithmetic number, because the mean of its divisors is an integer number (1207122770239).
Almost surely, 22414245540477 is an apocalyptic number.
It is an amenable number.
2414245540477 is a deficient number, since it is larger than the sum of its proper divisors (1).
2414245540477 is an equidigital number, since it uses as much as digits as its factorization.
2414245540477 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5017600, while the sum is 49.
The spelling of 2414245540477 in words is "two trillion, four hundred fourteen billion, two hundred forty-five million, five hundred forty thousand, four hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •