Base | Representation |
---|---|
bin | 111010010001010100… |
… | …0001010010101110011 |
3 | 102221222212120220011102 |
4 | 1310202220022111303 |
5 | 4022234030130133 |
6 | 133253005235015 |
7 | 12016650664406 |
oct | 1644250122563 |
9 | 387885526142 |
10 | 125135005043 |
11 | 490844a2444 |
12 | 20303562a6b |
13 | ba52cc48a9 |
14 | 60b130bd3d |
15 | 33c5bc87e8 |
hex | 1d22a0a573 |
125135005043 has 24 divisors (see below), whose sum is σ = 134688596256. Its totient is φ = 116200656000.
The previous prime is 125135005019. The next prime is 125135005049. The reversal of 125135005043 is 340500531521.
It is not a de Polignac number, because 125135005043 - 226 = 125067896179 is a prime.
It is a super-2 number, since 2×1251350050432 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 125135004997 and 125135005015.
It is not an unprimeable number, because it can be changed into a prime (125135005049) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 25272218 + ... + 25277168.
It is an arithmetic number, because the mean of its divisors is an integer number (5612024844).
Almost surely, 2125135005043 is an apocalyptic number.
125135005043 is a deficient number, since it is larger than the sum of its proper divisors (9553591213).
125135005043 is a wasteful number, since it uses less digits than its factorization.
125135005043 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6363 (or 6344 counting only the distinct ones).
The product of its (nonzero) digits is 9000, while the sum is 29.
Adding to 125135005043 its reverse (340500531521), we get a palindrome (465635536564).
The spelling of 125135005043 in words is "one hundred twenty-five billion, one hundred thirty-five million, five thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •