Base | Representation |
---|---|
bin | 1110111110100… |
… | …00010100000000 |
3 | 22202101212011102 |
4 | 13133100110000 |
5 | 224130240132 |
6 | 20244433532 |
7 | 3053604164 |
oct | 737202400 |
9 | 282355142 |
10 | 125633792 |
11 | 64a0a589 |
12 | 360a88a8 |
13 | 2004a32b |
14 | 12984ca4 |
15 | b069c62 |
hex | 77d0500 |
125633792 has 36 divisors (see below), whose sum is σ = 251565300. Its totient is φ = 62619648.
The previous prime is 125633749. The next prime is 125633819. The reversal of 125633792 is 297336521.
It can be written as a sum of positive squares in 2 ways, for example, as 106832896 + 18800896 = 10336^2 + 4336^2 .
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 114398 + ... + 115490.
It is an arithmetic number, because the mean of its divisors is an integer number (6987925).
Almost surely, 2125633792 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 125633792, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (125782650).
125633792 is an abundant number, since it is smaller than the sum of its proper divisors (125931508).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
125633792 is an equidigital number, since it uses as much as digits as its factorization.
125633792 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1558 (or 1544 counting only the distinct ones).
The product of its digits is 68040, while the sum is 38.
The square root of 125633792 is about 11208.6480897564. The cubic root of 125633792 is about 500.8436317703.
The spelling of 125633792 in words is "one hundred twenty-five million, six hundred thirty-three thousand, seven hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •