Base | Representation |
---|---|
bin | 111010010010001011… |
… | …0101000110011001001 |
3 | 102222001220002020122011 |
4 | 1310210112220303021 |
5 | 4022313433400031 |
6 | 133255522055521 |
7 | 12020452103551 |
oct | 1644426506311 |
9 | 388056066564 |
10 | 125163965641 |
11 | 49099882a20 |
12 | 203111aa5a1 |
13 | ba58cc4740 |
14 | 60b50ca161 |
15 | 33c84e96b1 |
hex | 1d245a8cc9 |
125163965641 has 32 divisors (see below), whose sum is σ = 154972339200. Its totient is φ = 99384252480.
The previous prime is 125163965623. The next prime is 125163965681. The reversal of 125163965641 is 146569361521.
It is a cyclic number.
It is not a de Polignac number, because 125163965641 - 213 = 125163957449 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (125163965681) 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 in 31 ways as a sum of consecutive naturals, for example, 2252110 + ... + 2307016.
It is an arithmetic number, because the mean of its divisors is an integer number (4842885600).
Almost surely, 2125163965641 is an apocalyptic number.
125163965641 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
125163965641 is a deficient number, since it is larger than the sum of its proper divisors (29808373559).
125163965641 is a wasteful number, since it uses less digits than its factorization.
125163965641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55789.
The product of its digits is 1166400, while the sum is 49.
The spelling of 125163965641 in words is "one hundred twenty-five billion, one hundred sixty-three million, nine hundred sixty-five thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.164 sec. • engine limits •