Base | Representation |
---|---|
bin | 100110101010… |
… | …011000110101 |
3 | 201001220201211 |
4 | 212222120311 |
5 | 10043310333 |
6 | 1001121421 |
7 | 152101243 |
oct | 46523065 |
9 | 21056654 |
10 | 10135093 |
11 | 57a2711 |
12 | 3489271 |
13 | 213b1c7 |
14 | 14bb793 |
15 | d52ecd |
hex | 9aa635 |
10135093 has 2 divisors, whose sum is σ = 10135094. Its totient is φ = 10135092.
The previous prime is 10135087. The next prime is 10135117. The reversal of 10135093 is 39053101.
10135093 is digitally balanced in base 2 and base 3, because in such bases it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8749764 + 1385329 = 2958^2 + 1177^2 .
It is an emirp because it is prime and its reverse (39053101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10135093 - 25 = 10135061 is a prime.
It is a super-2 number, since 2×101350932 = 205440220237298, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10130093) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5067546 + 5067547.
It is an arithmetic number, because the mean of its divisors is an integer number (5067547).
Almost surely, 210135093 is an apocalyptic number.
It is an amenable number.
10135093 is a deficient number, since it is larger than the sum of its proper divisors (1).
10135093 is an equidigital number, since it uses as much as digits as its factorization.
10135093 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 405, while the sum is 22.
The square root of 10135093 is about 3183.5660822417. The cubic root of 10135093 is about 216.4092962410.
Adding to 10135093 its reverse (39053101), we get a palindrome (49188194).
The spelling of 10135093 in words is "ten million, one hundred thirty-five thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •