Base | Representation |
---|---|
bin | 10100101010111… |
… | …111111001111001 |
3 | 220011121002021112 |
4 | 110222333321321 |
5 | 1202241103441 |
6 | 54225250105 |
7 | 11410613501 |
oct | 2452777171 |
9 | 804532245 |
10 | 346816121 |
11 | 1688500a3 |
12 | 98193935 |
13 | 56b0cc52 |
14 | 340bca01 |
15 | 206aa4eb |
hex | 14abfe79 |
346816121 has 4 divisors (see below), whose sum is σ = 347299200. Its totient is φ = 346333044.
The previous prime is 346816109. The next prime is 346816147. The reversal of 346816121 is 121618643.
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, and also an emirpimes, since its reverse is a distinct semiprime: 121618643 = 2671 ⋅45533.
It is a cyclic number.
It is not a de Polignac number, because 346816121 - 222 = 342621817 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (346816181) 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, 240461 + ... + 241898.
It is an arithmetic number, because the mean of its divisors is an integer number (86824800).
Almost surely, 2346816121 is an apocalyptic number.
It is an amenable number.
346816121 is a deficient number, since it is larger than the sum of its proper divisors (483079).
346816121 is an equidigital number, since it uses as much as digits as its factorization.
346816121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 483078.
The product of its digits is 6912, while the sum is 32.
The square root of 346816121 is about 18622.9997852118. Note that the first 3 decimals coincide. The cubic root of 346816121 is about 702.5864322929.
The spelling of 346816121 in words is "three hundred forty-six million, eight hundred sixteen thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •