Base | Representation |
---|---|
bin | 111010010011101111… |
… | …0000001010011000001 |
3 | 102222012112102200110222 |
4 | 1310213132001103001 |
5 | 4022420323421031 |
6 | 133305030232425 |
7 | 12021655262513 |
oct | 1644736012301 |
9 | 388175380428 |
10 | 125216232641 |
11 | 49116331995 |
12 | 203267b5715 |
13 | ba66a94966 |
14 | 60bc013bb3 |
15 | 33ccdc0e7b |
hex | 1d277814c1 |
125216232641 has 4 divisors (see below), whose sum is σ = 129255465984. Its totient is φ = 121176999300.
The previous prime is 125216232623. The next prime is 125216232653. The reversal of 125216232641 is 146232612521.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 146232612521 = 297439 ⋅491639.
It is a cyclic number.
It is not a de Polignac number, because 125216232641 - 230 = 124142490817 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (125216232601) 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 3 ways as a sum of consecutive naturals, for example, 2019616625 + ... + 2019616686.
It is an arithmetic number, because the mean of its divisors is an integer number (32313866496).
Almost surely, 2125216232641 is an apocalyptic number.
It is an amenable number.
125216232641 is a deficient number, since it is larger than the sum of its proper divisors (4039233343).
125216232641 is an equidigital number, since it uses as much as digits as its factorization.
125216232641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4039233342.
The product of its digits is 34560, while the sum is 35.
The spelling of 125216232641 in words is "one hundred twenty-five billion, two hundred sixteen million, two hundred thirty-two thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •