Base | Representation |
---|---|
bin | 10100011110000… |
… | …011000011000010 |
3 | 212221012121012211 |
4 | 110132003003002 |
5 | 1200403433442 |
6 | 54024412334 |
7 | 11340013522 |
oct | 2436030302 |
9 | 787177184 |
10 | 343421122 |
11 | 166941410 |
12 | 970170aa |
13 | 561c1885 |
14 | 33877682 |
15 | 20239617 |
hex | 147830c2 |
343421122 has 8 divisors (see below), whose sum is σ = 561961872. Its totient is φ = 156100500.
The previous prime is 343421093. The next prime is 343421129. The reversal of 343421122 is 221124343.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Harshad number since it is a multiple of its sum of digits (22), and also a Moran number because the ratio is a prime number: 15610051 = 343421122 / (3 + 4 + 3 + 4 + 2 + 1 + 1 + 2 + 2).
It is a junction number, because it is equal to n+sod(n) for n = 343421093 and 343421102.
It is not an unprimeable number, because it can be changed into a prime (343421129) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7805004 + ... + 7805047.
It is an arithmetic number, because the mean of its divisors is an integer number (70245234).
Almost surely, 2343421122 is an apocalyptic number.
343421122 is a deficient number, since it is larger than the sum of its proper divisors (218540750).
343421122 is a wasteful number, since it uses less digits than its factorization.
343421122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15610064.
The product of its digits is 1152, while the sum is 22.
The square root of 343421122 is about 18531.6249152631. The cubic root of 343421122 is about 700.2863603889.
Adding to 343421122 its reverse (221124343), we get a palindrome (564545465).
The spelling of 343421122 in words is "three hundred forty-three million, four hundred twenty-one thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •