Base | Representation |
---|---|
bin | 11100011011110010110001… |
… | …111100011101000010000101 |
3 | 121101210011110121112210200021 |
4 | 130123302301330131002011 |
5 | 112342401124310031000 |
6 | 1121545331253215141 |
7 | 35224641516351025 |
oct | 3433626174350205 |
9 | 541704417483607 |
10 | 125055253205125 |
11 | 369346a9283561 |
12 | 120386673314b1 |
13 | 54a18766b4a49 |
14 | 22c49c6ab9a85 |
15 | e6ce929dc11a |
hex | 71bcb1f1d085 |
125055253205125 has 8 divisors (see below), whose sum is σ = 156068956000152. Its totient is φ = 100044202564000.
The previous prime is 125055253205123. The next prime is 125055253205143. The reversal of 125055253205125 is 521502352550521.
It can be written as a sum of positive squares in 4 ways, for example, as 18115187365636 + 106940065839489 = 4256194^2 + 10341183^2 .
It is not a de Polignac number, because 125055253205125 - 21 = 125055253205123 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (125055253205123) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 500221012696 + ... + 500221012945.
It is an arithmetic number, because the mean of its divisors is an integer number (19508619500019).
Almost surely, 2125055253205125 is an apocalyptic number.
It is an amenable number.
125055253205125 is a deficient number, since it is larger than the sum of its proper divisors (31013702795027).
125055253205125 is an equidigital number, since it uses as much as digits as its factorization.
125055253205125 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1000442025656 (or 1000442025646 counting only the distinct ones).
The product of its (nonzero) digits is 750000, while the sum is 43.
The spelling of 125055253205125 in words is "one hundred twenty-five trillion, fifty-five billion, two hundred fifty-three million, two hundred five thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •