Base | Representation |
---|---|
bin | 100100111110000001110… |
… | …011011111110101100111 |
3 | 22222212111001102010100010 |
4 | 210332001303133311213 |
5 | 313110422334320201 |
6 | 5223031405221303 |
7 | 351355020606540 |
oct | 44760163376547 |
9 | 8885431363303 |
10 | 2540503432551 |
11 | 89a46aa58687 |
12 | 350449561833 |
13 | 155750b4bc86 |
14 | 8ad6508b4c7 |
15 | 4613e8dcbd6 |
hex | 24f81cdfd67 |
2540503432551 has 8 divisors (see below), whose sum is σ = 3871243325824. Its totient is φ = 1451716247160.
The previous prime is 2540503432543. The next prime is 2540503432559. The reversal of 2540503432551 is 1552343050452.
It is an interprime number because it is at equal distance from previous prime (2540503432543) and next prime (2540503432559).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2540503432551 - 23 = 2540503432543 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2540503432559) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 60488176945 + ... + 60488176986.
It is an arithmetic number, because the mean of its divisors is an integer number (483905415728).
Almost surely, 22540503432551 is an apocalyptic number.
2540503432551 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
2540503432551 is a deficient number, since it is larger than the sum of its proper divisors (1330739893273).
2540503432551 is a wasteful number, since it uses less digits than its factorization.
2540503432551 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 120976353941.
The product of its (nonzero) digits is 360000, while the sum is 39.
The spelling of 2540503432551 in words is "two trillion, five hundred forty billion, five hundred three million, four hundred thirty-two thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •