Base | Representation |
---|---|
bin | 111010010000111011… |
… | …1000100001111011001 |
3 | 102221221222101000210012 |
4 | 1310201313010033121 |
5 | 4022222231310001 |
6 | 133251425331305 |
7 | 12016433412413 |
oct | 1644167041731 |
9 | 387858330705 |
10 | 125122135001 |
11 | 49078201a46 |
12 | 202bb196b35 |
13 | ba50439896 |
14 | 60ad71b9b3 |
15 | 33c49d52bb |
hex | 1d21dc43d9 |
125122135001 has 8 divisors (see below), whose sum is σ = 127728673800. Its totient is φ = 122533511040.
The previous prime is 125122134971. The next prime is 125122135007. The reversal of 125122135001 is 100531221521.
It can be written as a sum of positive squares in 4 ways, for example, as 45924918601 + 79197216400 = 214301^2 + 281420^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 125122135001 - 222 = 125117940697 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (125122135007) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4464596 + ... + 4492533.
It is an arithmetic number, because the mean of its divisors is an integer number (15966084225).
Almost surely, 2125122135001 is an apocalyptic number.
It is an amenable number.
125122135001 is a deficient number, since it is larger than the sum of its proper divisors (2606538799).
125122135001 is an equidigital number, since it uses as much as digits as its factorization.
125122135001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8957419.
The product of its (nonzero) digits is 600, while the sum is 23.
Adding to 125122135001 its reverse (100531221521), we get a palindrome (225653356522).
The spelling of 125122135001 in words is "one hundred twenty-five billion, one hundred twenty-two million, one hundred thirty-five thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.476 sec. • engine limits •