Base | Representation |
---|---|
bin | 1110111111110… |
… | …10011000101010 |
3 | 22202201121120000 |
4 | 13133322120222 |
5 | 224201243442 |
6 | 20252243430 |
7 | 3055222461 |
oct | 737723052 |
9 | 282647500 |
10 | 125806122 |
11 | 65018002 |
12 | 36170576 |
13 | 200aa8c0 |
14 | 129cb9d8 |
15 | b0a0d4c |
hex | 77fa62a |
125806122 has 160 divisors (see below), whose sum is σ = 327849984. Its totient is φ = 35769600.
The previous prime is 125806111. The next prime is 125806123. The reversal of 125806122 is 221608521.
It is a happy number.
125806122 is a `hidden beast` number, since 1 + 2 + 580 + 61 + 22 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (125806123) 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 79 ways as a sum of consecutive naturals, for example, 2676703 + ... + 2676749.
Almost surely, 2125806122 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 125806122, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (163924992).
125806122 is an abundant number, since it is smaller than the sum of its proper divisors (202043862).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
125806122 is a wasteful number, since it uses less digits than its factorization.
125806122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 146 (or 137 counting only the distinct ones).
The product of its (nonzero) digits is 1920, while the sum is 27.
The square root of 125806122 is about 11216.3328231646. The cubic root of 125806122 is about 501.0725270598.
The spelling of 125806122 in words is "one hundred twenty-five million, eight hundred six thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •