Base | Representation |
---|---|
bin | 111010001101101011… |
… | …1001101110001010100 |
3 | 102221200101020121020112 |
4 | 1310123113031301110 |
5 | 4022011324402012 |
6 | 133232533022152 |
7 | 12013641001553 |
oct | 1643327156124 |
9 | 387611217215 |
10 | 125013122132 |
11 | 49021714a68 |
12 | 2028a784958 |
13 | ba3398b922 |
14 | 609d061d9a |
15 | 33ba150122 |
hex | 1d1b5cdc54 |
125013122132 has 12 divisors (see below), whose sum is σ = 219202776660. Its totient is φ = 62383757376.
The previous prime is 125013122111. The next prime is 125013122137. The reversal of 125013122132 is 231221310521.
125013122132 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 41817796036 + 83195326096 = 204494^2 + 288436^2 .
It is a junction number, because it is equal to n+sod(n) for n = 125013122098 and 125013122107.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (125013122137) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 30698633 + ... + 30702704.
It is an arithmetic number, because the mean of its divisors is an integer number (18266898055).
Almost surely, 2125013122132 is an apocalyptic number.
It is an amenable number.
125013122132 is a deficient number, since it is larger than the sum of its proper divisors (94189654528).
125013122132 is a wasteful number, since it uses less digits than its factorization.
125013122132 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 61401850 (or 61401848 counting only the distinct ones).
The product of its (nonzero) digits is 720, while the sum is 23.
Adding to 125013122132 its reverse (231221310521), we get a palindrome (356234432653).
The spelling of 125013122132 in words is "one hundred twenty-five billion, thirteen million, one hundred twenty-two thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •