Base | Representation |
---|---|
bin | 11100011100111011011101… |
… | …111001100010110001001101 |
3 | 121102001121220211110100221100 |
4 | 130130323131321202301031 |
5 | 112400140444303113041 |
6 | 1122045240000053313 |
7 | 35233403553530553 |
oct | 3434733571426115 |
9 | 542047824410840 |
10 | 125133300051021 |
11 | 36964809729a99 |
12 | 1204b809004239 |
13 | 54a9033c95072 |
14 | 22c86ac2b1bd3 |
15 | e7000e79d6b6 |
hex | 71cedde62c4d |
125133300051021 has 12 divisors (see below), whose sum is σ = 180880322549472. Its totient is φ = 83361174275976.
The previous prime is 125133300051007. The next prime is 125133300051029. The reversal of 125133300051021 is 120150003331521.
125133300051021 is a `hidden beast` number, since 1 + 251 + 3 + 3 + 300 + 0 + 5 + 102 + 1 = 666.
It is not a de Polignac number, because 125133300051021 - 219 = 125133299526733 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (125133300051029) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 5085466851 + ... + 5085491456.
It is an arithmetic number, because the mean of its divisors is an integer number (15073360212456).
Almost surely, 2125133300051021 is an apocalyptic number.
It is an amenable number.
125133300051021 is a deficient number, since it is larger than the sum of its proper divisors (55747022498451).
125133300051021 is a wasteful number, since it uses less digits than its factorization.
125133300051021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10170959680 (or 10170959677 counting only the distinct ones).
The product of its (nonzero) digits is 2700, while the sum is 27.
Adding to 125133300051021 its reverse (120150003331521), we get a palindrome (245283303382542).
The spelling of 125133300051021 in words is "one hundred twenty-five trillion, one hundred thirty-three billion, three hundred million, fifty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •