Base | Representation |
---|---|
bin | 11100011110000101111111… |
… | …001011001101011010011001 |
3 | 121102100021110020010101001110 |
4 | 130132011333023031122121 |
5 | 112402443332144201431 |
6 | 1122150111455010533 |
7 | 35242235451352065 |
oct | 3436057713153231 |
9 | 542307406111043 |
10 | 125213315225241 |
11 | 3699573a15a751 |
12 | 12063219b09a49 |
13 | 54b37462b08b9 |
14 | 22cc4dd07aaa5 |
15 | e72144268346 |
hex | 71e17f2cd699 |
125213315225241 has 16 divisors (see below), whose sum is σ = 178360941305600. Its totient is φ = 77901764065488.
The previous prime is 125213315225239. The next prime is 125213315225293. The reversal of 125213315225241 is 142522513312521.
It is a happy number.
It is not a de Polignac number, because 125213315225241 - 21 = 125213315225239 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 125213315225241.
It is not an unprimeable number, because it can be changed into a prime (125213315225231) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 16393465051 + ... + 16393472688.
It is an arithmetic number, because the mean of its divisors is an integer number (11147558831600).
Almost surely, 2125213315225241 is an apocalyptic number.
It is an amenable number.
125213315225241 is a deficient number, since it is larger than the sum of its proper divisors (53147626080359).
125213315225241 is a wasteful number, since it uses less digits than its factorization.
125213315225241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32786937828.
The product of its digits is 144000, while the sum is 39.
Adding to 125213315225241 its reverse (142522513312521), we get a palindrome (267735828537762).
The spelling of 125213315225241 in words is "one hundred twenty-five trillion, two hundred thirteen billion, three hundred fifteen million, two hundred twenty-five thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.287 sec. • engine limits •