Base | Representation |
---|---|
bin | 111010011010011011… |
… | …1111111100110100101 |
3 | 102222210012122102120201 |
4 | 1310310313333212211 |
5 | 4023400413122003 |
6 | 133343223030501 |
7 | 12030356066434 |
oct | 1646467774645 |
9 | 388705572521 |
10 | 125441145253 |
11 | 49221290086 |
12 | 20389b9b431 |
13 | baa1562448 |
14 | 60ddc3d11b |
15 | 33e29ebb1d |
hex | 1d34dff9a5 |
125441145253 has 4 divisors (see below), whose sum is σ = 125849748640. Its totient is φ = 125032541868.
The previous prime is 125441145229. The next prime is 125441145287. The reversal of 125441145253 is 352541144521.
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: 352541144521 = 15497 ⋅22748993.
It is a cyclic number.
It is not a de Polignac number, because 125441145253 - 225 = 125407590821 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 (125441148253) 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, 204301233 + ... + 204301846.
It is an arithmetic number, because the mean of its divisors is an integer number (31462437160).
Almost surely, 2125441145253 is an apocalyptic number.
It is an amenable number.
125441145253 is a deficient number, since it is larger than the sum of its proper divisors (408603387).
125441145253 is an equidigital number, since it uses as much as digits as its factorization.
125441145253 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 408603386.
The product of its digits is 96000, while the sum is 37.
Adding to 125441145253 its reverse (352541144521), we get a palindrome (477982289774).
The spelling of 125441145253 in words is "one hundred twenty-five billion, four hundred forty-one million, one hundred forty-five thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •