Base | Representation |
---|---|
bin | 111010011001101000… |
… | …0111101001100011001 |
3 | 102222201022211010212102 |
4 | 1310303100331030121 |
5 | 4023322004301203 |
6 | 133340420053145 |
7 | 12026610361151 |
oct | 1646320751431 |
9 | 388638733772 |
10 | 125414134553 |
11 | 49208011594 |
12 | 20380b341b5 |
13 | ba98a95c96 |
14 | 60da40b761 |
15 | 33e0463888 |
hex | 1d3343d319 |
125414134553 has 4 divisors (see below), whose sum is σ = 125428422528. Its totient is φ = 125399846580.
The previous prime is 125414134519. The next prime is 125414134591. The reversal of 125414134553 is 355431414521.
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: 355431414521 = 46993 ⋅7563497.
It is a cyclic number.
It is not a de Polignac number, because 125414134553 - 220 = 125413085977 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (125414134253) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7130813 + ... + 7148378.
It is an arithmetic number, because the mean of its divisors is an integer number (31357105632).
Almost surely, 2125414134553 is an apocalyptic number.
It is an amenable number.
125414134553 is a deficient number, since it is larger than the sum of its proper divisors (14287975).
125414134553 is an equidigital number, since it uses as much as digits as its factorization.
125414134553 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14287974.
The product of its digits is 144000, while the sum is 38.
The spelling of 125414134553 in words is "one hundred twenty-five billion, four hundred fourteen million, one hundred thirty-four thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •