Base | Representation |
---|---|
bin | 111010010101001100… |
… | …0010010100100000110 |
3 | 102222022221022110222022 |
4 | 1310222120102210012 |
5 | 4023020323442100 |
6 | 133313533003142 |
7 | 12023120313554 |
oct | 1645230224406 |
9 | 388287273868 |
10 | 125265062150 |
11 | 49140953258 |
12 | 2033b0234b2 |
13 | ba73c30367 |
14 | 60c46c4bd4 |
15 | 33d2318e85 |
hex | 1d2a612906 |
125265062150 has 48 divisors (see below), whose sum is σ = 246547577088. Its totient is φ = 47252436000.
The previous prime is 125265062119. The next prime is 125265062159. The reversal of 125265062150 is 51260562521.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 125265062150.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (125265062159) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 685436 + ... + 848735.
It is an arithmetic number, because the mean of its divisors is an integer number (5136407856).
Almost surely, 2125265062150 is an apocalyptic number.
125265062150 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
125265062150 is a deficient number, since it is larger than the sum of its proper divisors (121282514938).
125265062150 is a wasteful number, since it uses less digits than its factorization.
125265062150 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1534277 (or 1534272 counting only the distinct ones).
The product of its (nonzero) digits is 36000, while the sum is 35.
The spelling of 125265062150 in words is "one hundred twenty-five billion, two hundred sixty-five million, sixty-two thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •