Base | Representation |
---|---|
bin | 111010010011111110… |
… | …0100110110010110111 |
3 | 102222020002112000222121 |
4 | 1310213330212302313 |
5 | 4022424402004201 |
6 | 133305514140411 |
7 | 12022113365401 |
oct | 1644774466267 |
9 | 388202460877 |
10 | 125224250551 |
11 | 4911a908964 |
12 | 20329421707 |
13 | ba6864129a |
14 | 60bd0ddb71 |
15 | 33cd9569a1 |
hex | 1d27f26cb7 |
125224250551 has 4 divisors (see below), whose sum is σ = 131815000600. Its totient is φ = 118633500504.
The previous prime is 125224250549. The next prime is 125224250621. The reversal of 125224250551 is 155052422521.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 155052422521 = 181301 ⋅855221.
It is a cyclic number.
It is not a de Polignac number, because 125224250551 - 21 = 125224250549 is a prime.
It is a super-2 number, since 2×1252242505512 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (125224250051) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3295374996 + ... + 3295375033.
It is an arithmetic number, because the mean of its divisors is an integer number (32953750150).
Almost surely, 2125224250551 is an apocalyptic number.
125224250551 is a deficient number, since it is larger than the sum of its proper divisors (6590750049).
125224250551 is an equidigital number, since it uses as much as digits as its factorization.
125224250551 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6590750048.
The product of its (nonzero) digits is 40000, while the sum is 34.
The spelling of 125224250551 in words is "one hundred twenty-five billion, two hundred twenty-four million, two hundred fifty thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •