Base | Representation |
---|---|
bin | 100110101000… |
… | …000111000111 |
3 | 201001102221102 |
4 | 212220013013 |
5 | 10043011032 |
6 | 1001010315 |
7 | 152032121 |
oct | 46500707 |
9 | 21042842 |
10 | 10125767 |
11 | 5796703 |
12 | 348399b |
13 | 2136ba2 |
14 | 14b8211 |
15 | d50362 |
hex | 9a81c7 |
10125767 has 2 divisors, whose sum is σ = 10125768. Its totient is φ = 10125766.
The previous prime is 10125737. The next prime is 10125779. The reversal of 10125767 is 76752101.
10125767 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 10125767 - 210 = 10124743 is a prime.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10125737) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5062883 + 5062884.
It is an arithmetic number, because the mean of its divisors is an integer number (5062884).
Almost surely, 210125767 is an apocalyptic number.
10125767 is a deficient number, since it is larger than the sum of its proper divisors (1).
10125767 is an equidigital number, since it uses as much as digits as its factorization.
10125767 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2940, while the sum is 29.
The square root of 10125767 is about 3182.1010354795. The cubic root of 10125767 is about 216.3428981510.
Adding to 10125767 its reverse (76752101), we get a palindrome (86877868).
The spelling of 10125767 in words is "ten million, one hundred twenty-five thousand, seven hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 1.040 sec. • engine limits •