Base | Representation |
---|---|
bin | 111010010001101000… |
… | …0110001010101011001 |
3 | 102222000121121202000101 |
4 | 1310203100301111121 |
5 | 4022244241304041 |
6 | 133254025335401 |
7 | 12020140322653 |
oct | 1644320612531 |
9 | 388017552011 |
10 | 125145650521 |
11 | 4908a503561 |
12 | 20307037561 |
13 | ba552811a8 |
14 | 60b28bd6d3 |
15 | 33c6accb31 |
hex | 1d23431559 |
125145650521 has 4 divisors (see below), whose sum is σ = 126131049472. Its totient is φ = 124160251572.
The previous prime is 125145650503. The next prime is 125145650527. The reversal of 125145650521 is 125056541521.
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.
It is a cyclic number.
It is not a de Polignac number, because 125145650521 - 27 = 125145650393 is a prime.
It is a super-2 number, since 2×1251456505212 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (125145650527) 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, 492699285 + ... + 492699538.
It is an arithmetic number, because the mean of its divisors is an integer number (31532762368).
Almost surely, 2125145650521 is an apocalyptic number.
It is an amenable number.
125145650521 is a deficient number, since it is larger than the sum of its proper divisors (985398951).
125145650521 is an equidigital number, since it uses as much as digits as its factorization.
125145650521 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 985398950.
The product of its (nonzero) digits is 60000, while the sum is 37.
The spelling of 125145650521 in words is "one hundred twenty-five billion, one hundred forty-five million, six hundred fifty thousand, five hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •