Base | Representation |
---|---|
bin | 111010100001100101… |
… | …1111110100000000001 |
3 | 110000101221110202110101 |
4 | 1311003023332200001 |
5 | 4024343400432031 |
6 | 133423121402401 |
7 | 12036333060112 |
oct | 1650313764001 |
9 | 400357422411 |
10 | 125681264641 |
11 | 49334885359 |
12 | 20436499401 |
13 | bb0c22571a |
14 | 6123aa6209 |
15 | 3408b2d361 |
hex | 1d432fe801 |
125681264641 has 8 divisors (see below), whose sum is σ = 126465966144. Its totient is φ = 124896945840.
The previous prime is 125681264623. The next prime is 125681264663. The reversal of 125681264641 is 146462186521.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 125681264641 - 25 = 125681264609 is a prime.
It is a super-2 number, since 2×1256812646412 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 125681264591 and 125681264600.
It is not an unprimeable number, because it can be changed into a prime (125688264641) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 577926 + ... + 765088.
It is an arithmetic number, because the mean of its divisors is an integer number (15808245768).
Almost surely, 2125681264641 is an apocalyptic number.
It is an amenable number.
125681264641 is a deficient number, since it is larger than the sum of its proper divisors (784701503).
125681264641 is a wasteful number, since it uses less digits than its factorization.
125681264641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 191351.
The product of its digits is 552960, while the sum is 46.
The spelling of 125681264641 in words is "one hundred twenty-five billion, six hundred eighty-one million, two hundred sixty-four thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •