Base | Representation |
---|---|
bin | 1110111011001… |
… | …11101011100111 |
3 | 22201121002021111 |
4 | 13131213223213 |
5 | 224023031343 |
6 | 20231325451 |
7 | 3050140543 |
oct | 735475347 |
9 | 281532244 |
10 | 125205223 |
11 | 647475a0 |
12 | 35b20887 |
13 | 1cc2a240 |
14 | 128b2a23 |
15 | aed2c9d |
hex | 7767ae7 |
125205223 has 16 divisors (see below), whose sum is σ = 148176000. Its totient is φ = 104294880.
The previous prime is 125205211. The next prime is 125205229. The reversal of 125205223 is 322502521.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-125205223 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 125205194 and 125205203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (125205229) 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 15 ways as a sum of consecutive naturals, for example, 16728 + ... + 23026.
It is an arithmetic number, because the mean of its divisors is an integer number (9261000).
Almost surely, 2125205223 is an apocalyptic number.
125205223 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
125205223 is a deficient number, since it is larger than the sum of its proper divisors (22970777).
125205223 is a wasteful number, since it uses less digits than its factorization.
125205223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6462.
The product of its (nonzero) digits is 1200, while the sum is 22.
The square root of 125205223 is about 11189.5139751466. The cubic root of 125205223 is about 500.2734810556.
Adding to 125205223 its reverse (322502521), we get a palindrome (447707744).
The spelling of 125205223 in words is "one hundred twenty-five million, two hundred five thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •