Base | Representation |
---|---|
bin | 111010101001110000… |
… | …0000001010001101111 |
3 | 110001010000110122011022 |
4 | 1311103200001101233 |
5 | 4030423432014401 |
6 | 133510215444355 |
7 | 12046165306232 |
oct | 1652340012157 |
9 | 401100418138 |
10 | 125954954351 |
11 | 494653194a6 |
12 | 204b20866bb |
13 | bb53b40ab5 |
14 | 614c18b419 |
15 | 3422b9171b |
hex | 1d5380146f |
125954954351 has 2 divisors, whose sum is σ = 125954954352. Its totient is φ = 125954954350.
The previous prime is 125954954291. The next prime is 125954954387. The reversal of 125954954351 is 153459459521.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 125954954351 - 230 = 124881212527 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 125954954293 and 125954954302.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (125954954651) 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 as a sum of consecutive naturals, namely, 62977477175 + 62977477176.
It is an arithmetic number, because the mean of its divisors is an integer number (62977477176).
Almost surely, 2125954954351 is an apocalyptic number.
125954954351 is a deficient number, since it is larger than the sum of its proper divisors (1).
125954954351 is an equidigital number, since it uses as much as digits as its factorization.
125954954351 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 4860000, while the sum is 53.
The spelling of 125954954351 in words is "one hundred twenty-five billion, nine hundred fifty-four million, nine hundred fifty-four thousand, three hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •