Base | Representation |
---|---|
bin | 111010010001110001… |
… | …1000111101011110101 |
3 | 102222000221200010021201 |
4 | 1310203203013223311 |
5 | 4022302004220121 |
6 | 133254320412501 |
7 | 12020226235462 |
oct | 1644343075365 |
9 | 388027603251 |
10 | 125150460661 |
11 | 49092199486 |
12 | 20308777131 |
13 | ba56276725 |
14 | 60b33b2669 |
15 | 33c722ce91 |
hex | 1d238c7af5 |
125150460661 has 8 divisors (see below), whose sum is σ = 125653884480. Its totient is φ = 124647164928.
The previous prime is 125150460607. The next prime is 125150460679. The reversal of 125150460661 is 166064051521.
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 125150460661 - 211 = 125150458613 is a prime.
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 125150460661.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (125150430661) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2251360 + ... + 2306278.
It is an arithmetic number, because the mean of its divisors is an integer number (15706735560).
Almost surely, 2125150460661 is an apocalyptic number.
It is an amenable number.
125150460661 is a deficient number, since it is larger than the sum of its proper divisors (503423819).
125150460661 is an equidigital number, since it uses as much as digits as its factorization.
125150460661 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 64043.
The product of its (nonzero) digits is 43200, while the sum is 37.
The spelling of 125150460661 in words is "one hundred twenty-five billion, one hundred fifty million, four hundred sixty thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •