Base | Representation |
---|---|
bin | 111010010111001000… |
… | …0110010000110001101 |
3 | 102222111110212222110011 |
4 | 1310232100302012031 |
5 | 4023134012444041 |
6 | 133324221113221 |
7 | 12024541101622 |
oct | 1645620620615 |
9 | 388443788404 |
10 | 125330203021 |
11 | 491746a5591 |
12 | 203589b8811 |
13 | ba8458a25a |
14 | 60cd200349 |
15 | 33d7dd4e81 |
hex | 1d2e43218d |
125330203021 has 2 divisors, whose sum is σ = 125330203022. Its totient is φ = 125330203020.
The previous prime is 125330203001. The next prime is 125330203091. The reversal of 125330203021 is 120302033521.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 122770348996 + 2559854025 = 350386^2 + 50595^2 .
It is a cyclic number.
It is not a de Polignac number, because 125330203021 - 227 = 125195985293 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 125330202983 and 125330203001.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (125330203001) 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 as a sum of consecutive naturals, namely, 62665101510 + 62665101511.
It is an arithmetic number, because the mean of its divisors is an integer number (62665101511).
Almost surely, 2125330203021 is an apocalyptic number.
It is an amenable number.
125330203021 is a deficient number, since it is larger than the sum of its proper divisors (1).
125330203021 is an equidigital number, since it uses as much as digits as its factorization.
125330203021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1080, while the sum is 22.
Adding to 125330203021 its reverse (120302033521), we get a palindrome (245632236542).
The spelling of 125330203021 in words is "one hundred twenty-five billion, three hundred thirty million, two hundred three thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •