Base | Representation |
---|---|
bin | 101000001010111000110100… |
… | …0011001100101100011011011 |
3 | 1201100001222121120010102111122 |
4 | 1100111301220121211203123 |
5 | 332303111031441421321 |
6 | 3251254113303315455 |
7 | 134265660406515146 |
oct | 12025615031454333 |
9 | 1640058546112448 |
10 | 353340121045211 |
11 | a2648781854693 |
12 | 3376782374bb8b |
13 | 12220aa463a711 |
14 | 6337a7875505d |
15 | 2acb2c28188ab |
hex | 1415c686658db |
353340121045211 has 2 divisors, whose sum is σ = 353340121045212. Its totient is φ = 353340121045210.
The previous prime is 353340121045127. The next prime is 353340121045297. The reversal of 353340121045211 is 112540121043353.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-353340121045211 is a prime.
It is a super-2 number, since 2×3533401210452112 (a number of 30 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (353340121095211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 176670060522605 + 176670060522606.
It is an arithmetic number, because the mean of its divisors is an integer number (176670060522606).
Almost surely, 2353340121045211 is an apocalyptic number.
353340121045211 is a deficient number, since it is larger than the sum of its proper divisors (1).
353340121045211 is an equidigital number, since it uses as much as digits as its factorization.
353340121045211 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 43200, while the sum is 35.
Adding to 353340121045211 its reverse (112540121043353), we get a palindrome (465880242088564).
The spelling of 353340121045211 in words is "three hundred fifty-three trillion, three hundred forty billion, one hundred twenty-one million, forty-five thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •