Base | Representation |
---|---|
bin | 1000010110110… |
… | …1010110010101 |
3 | 2102221202210112 |
4 | 2011231112111 |
5 | 32433112101 |
6 | 3251132405 |
7 | 603633134 |
oct | 205552625 |
9 | 72852715 |
10 | 35050901 |
11 | 18870296 |
12 | b8a4105 |
13 | 7352ca2 |
14 | 492591b |
15 | 31256bb |
hex | 216d595 |
35050901 has 2 divisors, whose sum is σ = 35050902. Its totient is φ = 35050900.
The previous prime is 35050871. The next prime is 35050913. The reversal of 35050901 is 10905053.
35050901 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 34692100 + 358801 = 5890^2 + 599^2 .
It is an emirp because it is prime and its reverse (10905053) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 35050901 - 26 = 35050837 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 (35050931) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 17525450 + 17525451.
It is an arithmetic number, because the mean of its divisors is an integer number (17525451).
Almost surely, 235050901 is an apocalyptic number.
It is an amenable number.
35050901 is a deficient number, since it is larger than the sum of its proper divisors (1).
35050901 is an equidigital number, since it uses as much as digits as its factorization.
35050901 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 675, while the sum is 23.
The square root of 35050901 is about 5920.3801398221. The cubic root of 35050901 is about 327.2651261586.
Adding to 35050901 its reverse (10905053), we get a palindrome (45955954).
The spelling of 35050901 in words is "thirty-five million, fifty thousand, nine hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •