Base | Representation |
---|---|
bin | 111010011100011100… |
… | …1100111100100100001 |
3 | 102222221220201112210111 |
4 | 1310320321213210201 |
5 | 4024020210224334 |
6 | 133354034331321 |
7 | 12032136114601 |
oct | 1647071474441 |
9 | 388856645714 |
10 | 125508679969 |
11 | 492564179a2 |
12 | 203a8729b41 |
13 | bab2549b0a |
14 | 6108bbcc01 |
15 | 33e88dc064 |
hex | 1d38e67921 |
125508679969 has 2 divisors, whose sum is σ = 125508679970. Its totient is φ = 125508679968.
The previous prime is 125508679909. The next prime is 125508679987. The reversal of 125508679969 is 969976805521.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 101572877025 + 23935802944 = 318705^2 + 154712^2 .
It is an emirp because it is prime and its reverse (969976805521) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-125508679969 is a prime.
It is a super-2 number, since 2×1255086799692 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (125508679909) 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 as a sum of consecutive naturals, namely, 62754339984 + 62754339985.
It is an arithmetic number, because the mean of its divisors is an integer number (62754339985).
Almost surely, 2125508679969 is an apocalyptic number.
It is an amenable number.
125508679969 is a deficient number, since it is larger than the sum of its proper divisors (1).
125508679969 is an equidigital number, since it uses as much as digits as its factorization.
125508679969 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 73483200, while the sum is 67.
The spelling of 125508679969 in words is "one hundred twenty-five billion, five hundred eight million, six hundred seventy-nine thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •