Base | Representation |
---|---|
bin | 1110111011011… |
… | …01101111111101 |
3 | 22201122100101000 |
4 | 13131231233331 |
5 | 224024330302 |
6 | 20232040513 |
7 | 3050303160 |
oct | 735555775 |
9 | 281570330 |
10 | 125230077 |
11 | 64764235 |
12 | 35b33139 |
13 | 1cc3864b |
14 | 128bbad7 |
15 | aeda31c |
hex | 776dbfd |
125230077 has 32 divisors (see below), whose sum is σ = 212691200. Its totient is φ = 71337024.
The previous prime is 125230073. The next prime is 125230097. The reversal of 125230077 is 770032521.
It is not a de Polignac number, because 125230077 - 22 = 125230073 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
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 125230077.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (125230073) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 74199 + ... + 75867.
It is an arithmetic number, because the mean of its divisors is an integer number (6646600).
Almost surely, 2125230077 is an apocalyptic number.
It is an amenable number.
125230077 is a deficient number, since it is larger than the sum of its proper divisors (87461123).
125230077 is a wasteful number, since it uses less digits than its factorization.
125230077 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2082 (or 2076 counting only the distinct ones).
The product of its (nonzero) digits is 2940, while the sum is 27.
The square root of 125230077 is about 11190.6245134041. The cubic root of 125230077 is about 500.3065813107.
Adding to 125230077 its reverse (770032521), we get a palindrome (895262598).
It can be divided in two parts, 1252 and 30077, that added together give a square (31329 = 1772).
The spelling of 125230077 in words is "one hundred twenty-five million, two hundred thirty thousand, seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •