Base | Representation |
---|---|
bin | 100101001011101010001… |
… | …110000111110100011111 |
3 | 100001021021002222010101112 |
4 | 211023222032013310133 |
5 | 313330411334110130 |
6 | 5233452024532235 |
7 | 352413516606065 |
oct | 45135216076437 |
9 | 10037232863345 |
10 | 2555140144415 |
11 | 8a56a0aa9971 |
12 | 35325332107b |
13 | 156c4433b721 |
14 | 8b952d46035 |
15 | 466e9891495 |
hex | 252ea387d1f |
2555140144415 has 4 divisors (see below), whose sum is σ = 3066168173304. Its totient is φ = 2044112115528.
The previous prime is 2555140144399. The next prime is 2555140144423. The reversal of 2555140144415 is 5144410415552.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 2555140144415 - 24 = 2555140144399 is a prime.
It is a super-2 number, since 2×25551401444152 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
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, 255514014437 + ... + 255514014446.
It is an arithmetic number, because the mean of its divisors is an integer number (766542043326).
Almost surely, 22555140144415 is an apocalyptic number.
2555140144415 is a deficient number, since it is larger than the sum of its proper divisors (511028028889).
2555140144415 is an equidigital number, since it uses as much as digits as its factorization.
2555140144415 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 511028028888.
The product of its (nonzero) digits is 320000, while the sum is 41.
Adding to 2555140144415 its reverse (5144410415552), we get a palindrome (7699550559967).
The spelling of 2555140144415 in words is "two trillion, five hundred fifty-five billion, one hundred forty million, one hundred forty-four thousand, four hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •