Base | Representation |
---|---|
bin | 1000010110110… |
… | …1101001100011 |
3 | 2102221211111002 |
4 | 2011231221203 |
5 | 32433132011 |
6 | 3251142215 |
7 | 603636542 |
oct | 205555143 |
9 | 72854432 |
10 | 35052131 |
11 | 18871204 |
12 | b8a496b |
13 | 735370a |
14 | 4926159 |
15 | 3125c3b |
hex | 216da63 |
35052131 has 8 divisors (see below), whose sum is σ = 37121280. Its totient is φ = 33005448.
The previous prime is 35052109. The next prime is 35052137. The reversal of 35052131 is 13125053.
35052131 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 35052131 - 26 = 35052067 is a prime.
It is a super-2 number, since 2×350521312 = 2457303775282322, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (35052137) 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 in 7 ways as a sum of consecutive naturals, for example, 2351 + ... + 8696.
It is an arithmetic number, because the mean of its divisors is an integer number (4640160).
Almost surely, 235052131 is an apocalyptic number.
35052131 is a deficient number, since it is larger than the sum of its proper divisors (2069149).
35052131 is a wasteful number, since it uses less digits than its factorization.
35052131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11233.
The product of its (nonzero) digits is 450, while the sum is 20.
The square root of 35052131 is about 5920.4840173756. The cubic root of 35052131 is about 327.2689542237.
Adding to 35052131 its reverse (13125053), we get a palindrome (48177184).
The spelling of 35052131 in words is "thirty-five million, fifty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •