Base | Representation |
---|---|
bin | 100000110010110011… |
… | …100101000000111001 |
3 | 10100212222211001001002 |
4 | 200302303211000321 |
5 | 1034103300320441 |
6 | 24102021534345 |
7 | 2354406040223 |
oct | 406263450071 |
9 | 110788731032 |
10 | 35212120121 |
11 | 13a2a362022 |
12 | 69a85743b5 |
13 | 3422162849 |
14 | 19c0765413 |
15 | db14d0b9b |
hex | 832ce5039 |
35212120121 has 4 divisors (see below), whose sum is σ = 35302640100. Its totient is φ = 35121600144.
The previous prime is 35212120109. The next prime is 35212120147. The reversal of 35212120121 is 12102121253.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 9228292096 + 25983828025 = 96064^2 + 161195^2 .
It is a cyclic number.
It is not a de Polignac number, because 35212120121 - 210 = 35212119097 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 35212120093 and 35212120102.
It is not an unprimeable number, because it can be changed into a prime (35212120171) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 45259406 + ... + 45260183.
It is an arithmetic number, because the mean of its divisors is an integer number (8825660025).
Almost surely, 235212120121 is an apocalyptic number.
It is an amenable number.
35212120121 is a deficient number, since it is larger than the sum of its proper divisors (90519979).
35212120121 is an equidigital number, since it uses as much as digits as its factorization.
35212120121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 90519978.
The product of its (nonzero) digits is 240, while the sum is 20.
Adding to 35212120121 its reverse (12102121253), we get a palindrome (47314241374).
The spelling of 35212120121 in words is "thirty-five billion, two hundred twelve million, one hundred twenty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •