Base | Representation |
---|---|
bin | 1110111010101… |
… | …11001011101101 |
3 | 22201110122120121 |
4 | 13131113023231 |
5 | 224013401040 |
6 | 20230044541 |
7 | 3046436533 |
oct | 735271355 |
9 | 281418517 |
10 | 125137645 |
11 | 64700846 |
12 | 35aa9751 |
13 | 1cc05559 |
14 | 12896153 |
15 | aebcc4a |
hex | 77572ed |
125137645 has 8 divisors (see below), whose sum is σ = 150229656. Its totient is φ = 100067136.
The previous prime is 125137633. The next prime is 125137673. The reversal of 125137645 is 546731521.
It can be written as a sum of positive squares in 4 ways, for example, as 7241481 + 117896164 = 2691^2 + 10858^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 125137645 - 221 = 123040493 is a prime.
It is a super-3 number, since 3×1251376453 (a number of 25 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 125137645.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 13399 + ... + 20731.
It is an arithmetic number, because the mean of its divisors is an integer number (18778707).
Almost surely, 2125137645 is an apocalyptic number.
It is an amenable number.
125137645 is a deficient number, since it is larger than the sum of its proper divisors (25092011).
125137645 is an equidigital number, since it uses as much as digits as its factorization.
125137645 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10751.
The product of its digits is 25200, while the sum is 34.
The square root of 125137645 is about 11186.4938653718. The cubic root of 125137645 is about 500.1834593438.
The spelling of 125137645 in words is "one hundred twenty-five million, one hundred thirty-seven thousand, six hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •