Base | Representation |
---|---|
bin | 111010010001001111… |
… | …0100111111111010101 |
3 | 102221222200212212210220 |
4 | 1310202132213333111 |
5 | 4022232410130140 |
6 | 133252435504553 |
7 | 12016620512652 |
oct | 1644236477725 |
9 | 387880785726 |
10 | 125132505045 |
11 | 49083045129 |
12 | 20302758159 |
13 | ba5262a9c2 |
14 | 60b0c5ac29 |
15 | 33c5882bd0 |
hex | 1d227a7fd5 |
125132505045 has 8 divisors (see below), whose sum is σ = 200212008096. Its totient is φ = 66737336016.
The previous prime is 125132505019. The next prime is 125132505053. The reversal of 125132505045 is 540505231521.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 125132505045 - 211 = 125132502997 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 125132504997 and 125132505015.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4171083487 + ... + 4171083516.
It is an arithmetic number, because the mean of its divisors is an integer number (25026501012).
Almost surely, 2125132505045 is an apocalyptic number.
125132505045 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
125132505045 is a deficient number, since it is larger than the sum of its proper divisors (75079503051).
125132505045 is an equidigital number, since it uses as much as digits as its factorization.
125132505045 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8342167011.
The product of its (nonzero) digits is 30000, while the sum is 33.
Adding to 125132505045 its reverse (540505231521), we get a palindrome (665637736566).
The spelling of 125132505045 in words is "one hundred twenty-five billion, one hundred thirty-two million, five hundred five thousand, forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •