Base | Representation |
---|---|
bin | 111011010101100101… |
… | …1001101011010101111 |
3 | 110011220112022010002220 |
4 | 1312223023031122233 |
5 | 4041432012102223 |
6 | 134312203050423 |
7 | 12130506141216 |
oct | 1665313153257 |
9 | 404815263086 |
10 | 127425894063 |
11 | 4a04a660256 |
12 | 20842810a13 |
13 | c0297c9a20 |
14 | 624b68807d |
15 | 34abd9a6e3 |
hex | 1dab2cd6af |
127425894063 has 32 divisors (see below), whose sum is σ = 192382895040. Its totient is φ = 74470717440.
The previous prime is 127425894047. The next prime is 127425894073. The reversal of 127425894063 is 360498524721.
It is not a de Polignac number, because 127425894063 - 24 = 127425894047 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 127425893997 and 127425894015.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (127425894073) 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 31 ways as a sum of consecutive naturals, for example, 854506 + ... + 992487.
It is an arithmetic number, because the mean of its divisors is an integer number (6011965470).
It is a 1-persistent number, because it is pandigital, but 2⋅127425894063 = 254851788126 is not.
Almost surely, 2127425894063 is an apocalyptic number.
127425894063 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
127425894063 is a deficient number, since it is larger than the sum of its proper divisors (64957000977).
127425894063 is a wasteful number, since it uses less digits than its factorization.
127425894063 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1847099.
The product of its (nonzero) digits is 2903040, while the sum is 51.
The spelling of 127425894063 in words is "one hundred twenty-seven billion, four hundred twenty-five million, eight hundred ninety-four thousand, sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •