Base | Representation |
---|---|
bin | 100111100011… |
… | …111001111001 |
3 | 201111212220022 |
4 | 213203321321 |
5 | 10123330211 |
6 | 1010140225 |
7 | 154102136 |
oct | 47437171 |
9 | 21455808 |
10 | 10370681 |
11 | 5943712 |
12 | 3581675 |
13 | 21c14c9 |
14 | 153d58d |
15 | d9cbdb |
hex | 9e3e79 |
10370681 has 2 divisors, whose sum is σ = 10370682. Its totient is φ = 10370680.
The previous prime is 10370653. The next prime is 10370687. The reversal of 10370681 is 18607301.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5683456 + 4687225 = 2384^2 + 2165^2 .
It is an emirp because it is prime and its reverse (18607301) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10370681 - 26 = 10370617 is a prime.
It is a super-2 number, since 2×103706812 = 215102048807522, which contains 22 as substring.
It is a Sophie Germain prime.
It is a Chen prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 10370681.
It is not a weakly prime, because it can be changed into another prime (10370687) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5185340 + 5185341.
It is an arithmetic number, because the mean of its divisors is an integer number (5185341).
Almost surely, 210370681 is an apocalyptic number.
It is an amenable number.
10370681 is a deficient number, since it is larger than the sum of its proper divisors (1).
10370681 is an equidigital number, since it uses as much as digits as its factorization.
10370681 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1008, while the sum is 26.
The square root of 10370681 is about 3220.3541730685. The cubic root of 10370681 is about 218.0732646601.
Adding to 10370681 its reverse (18607301), we get a palindrome (28977982).
The spelling of 10370681 in words is "ten million, three hundred seventy thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •