Base | Representation |
---|---|
bin | 1110111011001… |
… | …11110111111101 |
3 | 22201121010100202 |
4 | 13131213313331 |
5 | 224023043023 |
6 | 20231333245 |
7 | 3050143052 |
oct | 735476775 |
9 | 281533322 |
10 | 125206013 |
11 | 64748149 |
12 | 35b21225 |
13 | 1cc2a6ca |
14 | 128b3029 |
15 | aed3128 |
hex | 7767dfd |
125206013 has 4 divisors (see below), whose sum is σ = 125651868. Its totient is φ = 124760160.
The previous prime is 125206009. The next prime is 125206027. The reversal of 125206013 is 310602521.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 98446084 + 26759929 = 9922^2 + 5173^2 .
It is a cyclic number.
It is not a de Polignac number, because 125206013 - 22 = 125206009 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (125206033) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 222506 + ... + 223067.
It is an arithmetic number, because the mean of its divisors is an integer number (31412967).
Almost surely, 2125206013 is an apocalyptic number.
It is an amenable number.
125206013 is a deficient number, since it is larger than the sum of its proper divisors (445855).
125206013 is an equidigital number, since it uses as much as digits as its factorization.
125206013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 445854.
The product of its (nonzero) digits is 360, while the sum is 20.
The square root of 125206013 is about 11189.5492759986. The cubic root of 125206013 is about 500.2745332354.
Adding to 125206013 its reverse (310602521), we get a palindrome (435808534).
It can be divided in two parts, 12 and 5206013, that added together give a palindrome (5206025).
The spelling of 125206013 in words is "one hundred twenty-five million, two hundred six thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •