Base | Representation |
---|---|
bin | 111010010000100001… |
… | …1100110000000111001 |
3 | 102221221000222111122211 |
4 | 1310201003212000321 |
5 | 4022210303014344 |
6 | 133250224215121 |
7 | 12016210623652 |
oct | 1644103460071 |
9 | 387830874584 |
10 | 125108641849 |
11 | 49070626384 |
12 | 202b676a4a1 |
13 | ba4a6c4079 |
14 | 60aba08529 |
15 | 33c371c334 |
hex | 1d210e6039 |
125108641849 has 9 divisors (see below), whose sum is σ = 128249363311. Its totient is φ = 122043063280.
The previous prime is 125108641843. The next prime is 125108642017. The reversal of 125108641849 is 948146801521.
The square root of 125108641849 is 353707.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 6028435449 + 119080206400 = 77643^2 + 345080^2 .
It is not a de Polignac number, because 125108641849 - 215 = 125108609081 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (125108641843) by changing a digit.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 14497674 + ... + 14506300.
Almost surely, 2125108641849 is an apocalyptic number.
125108641849 is the 353707-th square number.
125108641849 is the 176854-th centered octagonal number.
It is an amenable number.
125108641849 is a deficient number, since it is larger than the sum of its proper divisors (3140721462).
125108641849 is an frugal number, since it uses more digits than its factorization.
125108641849 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17336 (or 8668 counting only the distinct ones).
The product of its (nonzero) digits is 552960, while the sum is 49.
Multiplying 125108641849 by its sum of digits (49), we get a square (6130323450601 = 24759492).
The spelling of 125108641849 in words is "one hundred twenty-five billion, one hundred eight million, six hundred forty-one thousand, eight hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •