Base | Representation |
---|---|
bin | 111010111010011010… |
… | …0101010101110101111 |
3 | 110002112222102212101212 |
4 | 1311310310222232233 |
5 | 4033100041441101 |
6 | 134041510225035 |
7 | 12066064246136 |
oct | 1656464525657 |
9 | 402488385355 |
10 | 126514015151 |
11 | 49721955117 |
12 | 2062935517b |
13 | bc129044c4 |
14 | 61a251891d |
15 | 3456cc41bb |
hex | 1d74d2abaf |
126514015151 has 16 divisors (see below), whose sum is σ = 127927537920. Its totient is φ = 125109552000.
The previous prime is 126514015141. The next prime is 126514015193. The reversal of 126514015151 is 151510415621.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-126514015151 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (126514015141) 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 15 ways as a sum of consecutive naturals, for example, 62413400 + ... + 62415426.
It is an arithmetic number, because the mean of its divisors is an integer number (7995471120).
Almost surely, 2126514015151 is an apocalyptic number.
126514015151 is a deficient number, since it is larger than the sum of its proper divisors (1413522769).
126514015151 is a wasteful number, since it uses less digits than its factorization.
126514015151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3934.
The product of its (nonzero) digits is 6000, while the sum is 32.
The spelling of 126514015151 in words is "one hundred twenty-six billion, five hundred fourteen million, fifteen thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •