Base | Representation |
---|---|
bin | 111010011010110000… |
… | …1111101000111110101 |
3 | 102222210222100021120222 |
4 | 1310311201331013311 |
5 | 4023411222121031 |
6 | 133344254504125 |
7 | 12030551432201 |
oct | 1646541750765 |
9 | 388728307528 |
10 | 125452145141 |
11 | 492275134a4 |
12 | 20391805045 |
13 | baa391415b |
14 | 61014a3b01 |
15 | 33e3970e7b |
hex | 1d3587d1f5 |
125452145141 has 4 divisors (see below), whose sum is σ = 125454434400. Its totient is φ = 125449855884.
The previous prime is 125452145113. The next prime is 125452145149. The reversal of 125452145141 is 141541254521.
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: 141541254521 = 157 ⋅901536653.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-125452145141 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 (125452145149) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1060361 + ... + 1172718.
It is an arithmetic number, because the mean of its divisors is an integer number (31363608600).
Almost surely, 2125452145141 is an apocalyptic number.
It is an amenable number.
125452145141 is a deficient number, since it is larger than the sum of its proper divisors (2289259).
125452145141 is an equidigital number, since it uses as much as digits as its factorization.
125452145141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2289258.
The product of its digits is 32000, while the sum is 35.
Adding to 125452145141 its reverse (141541254521), we get a palindrome (266993399662).
The spelling of 125452145141 in words is "one hundred twenty-five billion, four hundred fifty-two million, one hundred forty-five thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •