Base | Representation |
---|---|
bin | 100111000001110110011100… |
… | …1111000011011011000101001 |
3 | 1200000112100110210020120101120 |
4 | 1032003230321320123120221 |
5 | 324444130000004430441 |
6 | 3214050432411405453 |
7 | 132211515433642011 |
oct | 11603547170333051 |
9 | 1600470423216346 |
10 | 343302002030121 |
11 | 9a42861a310412 |
12 | 32606289a53889 |
13 | 11973317036484 |
14 | 60abc96bb2c41 |
15 | 29a51160e2966 |
hex | 1383b39e1b629 |
343302002030121 has 8 divisors (see below), whose sum is σ = 460107691840800. Its totient is φ = 227682156786432.
The previous prime is 343302002030111. The next prime is 343302002030147. The reversal of 343302002030121 is 121030200203343.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 343302002030121 - 25 = 343302002030089 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 343302002030091 and 343302002030100.
It is not an unprimeable number, because it can be changed into a prime (343302002030111) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 296461141071 + ... + 296461142228.
It is an arithmetic number, because the mean of its divisors is an integer number (57513461480100).
Almost surely, 2343302002030121 is an apocalyptic number.
It is an amenable number.
343302002030121 is a deficient number, since it is larger than the sum of its proper divisors (116805689810679).
343302002030121 is a wasteful number, since it uses less digits than its factorization.
343302002030121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 592922283495.
The product of its (nonzero) digits is 2592, while the sum is 24.
Adding to 343302002030121 its reverse (121030200203343), we get a palindrome (464332202233464).
The spelling of 343302002030121 in words is "three hundred forty-three trillion, three hundred two billion, two million, thirty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •