Base | Representation |
---|---|
bin | 111010010001110000… |
… | …1110000111110110001 |
3 | 102222000221000002010101 |
4 | 1310203201300332301 |
5 | 4022301411334041 |
6 | 133254305032401 |
7 | 12020223226210 |
oct | 1644341607661 |
9 | 388027002111 |
10 | 125150105521 |
11 | 49091a76681 |
12 | 20308625701 |
13 | ba56180b9c |
14 | 60b331d077 |
15 | 33c71acb31 |
hex | 1d23870fb1 |
125150105521 has 48 divisors (see below), whose sum is σ = 160210327680. Its totient is φ = 95171328000.
The previous prime is 125150105473. The next prime is 125150105533. The reversal of 125150105521 is 125501051521.
It is not a de Polignac number, because 125150105521 - 219 = 125149581233 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 125150105521.
It is not an unprimeable number, because it can be changed into a prime (125150105021) 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 47 ways as a sum of consecutive naturals, for example, 178530471 + ... + 178531171.
It is an arithmetic number, because the mean of its divisors is an integer number (3337715160).
Almost surely, 2125150105521 is an apocalyptic number.
It is an amenable number.
125150105521 is a deficient number, since it is larger than the sum of its proper divisors (35060222159).
125150105521 is an equidigital number, since it uses as much as digits as its factorization.
125150105521 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1306 (or 1025 counting only the distinct ones).
The product of its (nonzero) digits is 2500, while the sum is 28.
The spelling of 125150105521 in words is "one hundred twenty-five billion, one hundred fifty million, one hundred five thousand, five hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •