Base | Representation |
---|---|
bin | 11100111010010011111111… |
… | …111101100011100011001001 |
3 | 121200012122211202222111122102 |
4 | 130322103333331203203021 |
5 | 113131231313034013012 |
6 | 1130233015510403145 |
7 | 35532315431330510 |
oct | 3472237775434311 |
9 | 550178752874572 |
10 | 127152506157257 |
11 | 37573090959749 |
12 | 123170110604b5 |
13 | 55c45785ab629 |
14 | 23582dd82b677 |
15 | ea77dd9792c2 |
hex | 73a4fff638c9 |
127152506157257 has 16 divisors (see below), whose sum is σ = 157138945574400. Its totient is φ = 100394326330368.
The previous prime is 127152506157251. The next prime is 127152506157419. The reversal of 127152506157257 is 752751605251721.
It is not a de Polignac number, because 127152506157257 - 212 = 127152506153161 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (127152506157251) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 11367105632 + ... + 11367116817.
It is an arithmetic number, because the mean of its divisors is an integer number (9821184098400).
Almost surely, 2127152506157257 is an apocalyptic number.
127152506157257 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
It is an amenable number.
127152506157257 is a deficient number, since it is larger than the sum of its proper divisors (29986439417143).
127152506157257 is a wasteful number, since it uses less digits than its factorization.
127152506157257 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22734222520.
The product of its (nonzero) digits is 10290000, while the sum is 56.
The spelling of 127152506157257 in words is "one hundred twenty-seven trillion, one hundred fifty-two billion, five hundred six million, one hundred fifty-seven thousand, two hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •