Base | Representation |
---|---|
bin | 111010010001100110… |
… | …0111011110110110111 |
3 | 102222000112201122202121 |
4 | 1310203030323312313 |
5 | 4022244012120142 |
6 | 133253552020411 |
7 | 12020125634362 |
oct | 1644314736667 |
9 | 388015648677 |
10 | 125144645047 |
11 | 49089987094 |
12 | 20306831707 |
13 | ba54cbb636 |
14 | 60b26db0d9 |
15 | 33c697ec67 |
hex | 1d2333bdb7 |
125144645047 has 2 divisors, whose sum is σ = 125144645048. Its totient is φ = 125144645046.
The previous prime is 125144644957. The next prime is 125144645051. The reversal of 125144645047 is 740546441521.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 125144645047 - 211 = 125144642999 is a prime.
It is a super-2 number, since 2×1251446450472 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 125144644994 and 125144645012.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (125144645057) 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 as a sum of consecutive naturals, namely, 62572322523 + 62572322524.
It is an arithmetic number, because the mean of its divisors is an integer number (62572322524).
Almost surely, 2125144645047 is an apocalyptic number.
125144645047 is a deficient number, since it is larger than the sum of its proper divisors (1).
125144645047 is an equidigital number, since it uses as much as digits as its factorization.
125144645047 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 537600, while the sum is 43.
The spelling of 125144645047 in words is "one hundred twenty-five billion, one hundred forty-four million, six hundred forty-five thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •