Base | Representation |
---|---|
bin | 1001111111110110010… |
… | …10001010010001001101 |
3 | 1012211200020021001111112 |
4 | 10333323022022101031 |
5 | 21112010114123401 |
6 | 421450435301405 |
7 | 33550436122601 |
oct | 4777312122115 |
9 | 1184606231445 |
10 | 343516161101 |
11 | 122758a10203 |
12 | 566aaa4a865 |
13 | 265164b8769 |
14 | 128aa6b7501 |
15 | 8e07be63bb |
hex | 4ffb28a44d |
343516161101 has 4 divisors (see below), whose sum is σ = 348221862012. Its totient is φ = 338810460192.
The previous prime is 343516161071. The next prime is 343516161113. The reversal of 343516161101 is 101161615343.
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 298661157001 + 44855004100 = 546499^2 + 211790^2 .
It is a cyclic number.
It is not a de Polignac number, because 343516161101 - 210 = 343516160077 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (343516161151) 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, 2352850346 + ... + 2352850491.
It is an arithmetic number, because the mean of its divisors is an integer number (87055465503).
Almost surely, 2343516161101 is an apocalyptic number.
It is an amenable number.
343516161101 is a deficient number, since it is larger than the sum of its proper divisors (4705700911).
343516161101 is an equidigital number, since it uses as much as digits as its factorization.
343516161101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4705700910.
The product of its (nonzero) digits is 6480, while the sum is 32.
Adding to 343516161101 its reverse (101161615343), we get a palindrome (444677776444).
The spelling of 343516161101 in words is "three hundred forty-three billion, five hundred sixteen million, one hundred sixty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •