Base | Representation |
---|---|
bin | 1010010110000000101… |
… | …01111110100101011001 |
3 | 1020222101102201101200222 |
4 | 11023000111332211121 |
5 | 21310342030230423 |
6 | 431135230005425 |
7 | 34451332514240 |
oct | 5130025764531 |
9 | 1228342641628 |
10 | 355414305113 |
11 | 12780412297a |
12 | 58a6b646875 |
13 | 27691509a6a |
14 | 132b897d957 |
15 | 93a25473c8 |
hex | 52c057e959 |
355414305113 has 4 divisors (see below), whose sum is σ = 406187777280. Its totient is φ = 304640832948.
The previous prime is 355414305109. The next prime is 355414305179. The reversal of 355414305113 is 311503414553.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 355414305113 - 22 = 355414305109 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (355414305013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 25386736073 + ... + 25386736086.
It is an arithmetic number, because the mean of its divisors is an integer number (101546944320).
Almost surely, 2355414305113 is an apocalyptic number.
It is an amenable number.
355414305113 is a deficient number, since it is larger than the sum of its proper divisors (50773472167).
355414305113 is an equidigital number, since it uses as much as digits as its factorization.
355414305113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50773472166.
The product of its (nonzero) digits is 54000, while the sum is 35.
Adding to 355414305113 its reverse (311503414553), we get a palindrome (666917719666).
The spelling of 355414305113 in words is "three hundred fifty-five billion, four hundred fourteen million, three hundred five thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •