Base | Representation |
---|---|
bin | 10101001010010… |
… | …000111000011001 |
3 | 220202000111002002 |
4 | 111022100320121 |
5 | 1211340341441 |
6 | 55121050345 |
7 | 11540360522 |
oct | 2512207031 |
9 | 822014062 |
10 | 355012121 |
11 | 172438952 |
12 | 9aa869b5 |
13 | 5871c659 |
14 | 35213849 |
15 | 21278b9b |
hex | 15290e19 |
355012121 has 2 divisors, whose sum is σ = 355012122. Its totient is φ = 355012120.
The previous prime is 355012111. The next prime is 355012123. The reversal of 355012121 is 121210553.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 272910400 + 82101721 = 16520^2 + 9061^2 .
It is an emirp because it is prime and its reverse (121210553) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 355012121 - 214 = 354995737 is a prime.
Together with 355012123, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 355012093 and 355012102.
It is not a weakly prime, because it can be changed into another prime (355012123) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 177506060 + 177506061.
It is an arithmetic number, because the mean of its divisors is an integer number (177506061).
Almost surely, 2355012121 is an apocalyptic number.
It is an amenable number.
355012121 is a deficient number, since it is larger than the sum of its proper divisors (1).
355012121 is an equidigital number, since it uses as much as digits as its factorization.
355012121 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 300, while the sum is 20.
The square root of 355012121 is about 18841.7653366132. The cubic root of 355012121 is about 708.0779337163.
Adding to 355012121 its reverse (121210553), we get a palindrome (476222674).
The spelling of 355012121 in words is "three hundred fifty-five million, twelve thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •