Base | Representation |
---|---|
bin | 11100000010100… |
… | …00110110001001 |
3 | 121101121000102211 |
4 | 32001100312021 |
5 | 440203242134 |
6 | 35201225121 |
7 | 5554161523 |
oct | 1601206611 |
9 | 541530384 |
10 | 235212169 |
11 | 110853425 |
12 | 669321a1 |
13 | 399657ca |
14 | 2334aa13 |
15 | 159b2764 |
hex | e050d89 |
235212169 has 2 divisors, whose sum is σ = 235212170. Its totient is φ = 235212168.
The previous prime is 235212167. The next prime is 235212217. The reversal of 235212169 is 961212532.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 229977225 + 5234944 = 15165^2 + 2288^2 .
It is a cyclic number.
It is not a de Polignac number, because 235212169 - 21 = 235212167 is a prime.
It is a super-2 number, since 2×2352121692 = 110649528891369122, which contains 22 as substring.
Together with 235212167, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 235212169.
It is not a weakly prime, because it can be changed into another prime (235212161) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 117606084 + 117606085.
It is an arithmetic number, because the mean of its divisors is an integer number (117606085).
Almost surely, 2235212169 is an apocalyptic number.
It is an amenable number.
235212169 is a deficient number, since it is larger than the sum of its proper divisors (1).
235212169 is an equidigital number, since it uses as much as digits as its factorization.
235212169 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 6480, while the sum is 31.
The square root of 235212169 is about 15336.6283452394. The cubic root of 235212169 is about 617.2862391776.
The spelling of 235212169 in words is "two hundred thirty-five million, two hundred twelve thousand, one hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •