Base | Representation |
---|---|
bin | 111011100011100110… |
… | …1011100100101110111 |
3 | 110020010022100021221021 |
4 | 1313013031130211313 |
5 | 4043412414230201 |
6 | 134431004202011 |
7 | 12145250060500 |
oct | 1670715344567 |
9 | 406108307837 |
10 | 127896242551 |
11 | 4a271105010 |
12 | 20954239307 |
13 | c0a309c63c |
14 | 6293d21ba7 |
15 | 34d8307ea1 |
hex | 1dc735c977 |
127896242551 has 24 divisors (see below), whose sum is σ = 162690111360. Its totient is φ = 99421383600.
The previous prime is 127896242543. The next prime is 127896242557. The reversal of 127896242551 is 155242698721.
It is a happy number.
It is not a de Polignac number, because 127896242551 - 23 = 127896242543 is a prime.
It is a Smith number, since the sum of its digits (52) coincides with the sum of the digits of its prime factors.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (127896242557) 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 in 23 ways as a sum of consecutive naturals, for example, 57315 + ... + 508996.
It is an arithmetic number, because the mean of its divisors is an integer number (6778754640).
Almost surely, 2127896242551 is an apocalyptic number.
127896242551 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
127896242551 is a deficient number, since it is larger than the sum of its proper divisors (34793868809).
127896242551 is a wasteful number, since it uses less digits than its factorization.
127896242551 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 566755 (or 566748 counting only the distinct ones).
The product of its digits is 2419200, while the sum is 52.
The spelling of 127896242551 in words is "one hundred twenty-seven billion, eight hundred ninety-six million, two hundred forty-two thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •