Base | Representation |
---|---|
bin | 10100100100101… |
… | …011111000001010 |
3 | 220001111000012010 |
4 | 110210223320022 |
5 | 1201330124401 |
6 | 54130000350 |
7 | 11360551644 |
oct | 2444537012 |
9 | 801430163 |
10 | 345161226 |
11 | 16791a813 |
12 | 977160b6 |
13 | 56680917 |
14 | 33bab894 |
15 | 2047eed6 |
hex | 1492be0a |
345161226 has 8 divisors (see below), whose sum is σ = 690322464. Its totient is φ = 115053740.
The previous prime is 345161221. The next prime is 345161231. The reversal of 345161226 is 622161543.
It is an interprime number because it is at equal distance from previous prime (345161221) and next prime (345161231).
It is a sphenic number, since it is the product of 3 distinct primes.
345161226 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 345161193 and 345161202.
It is not an unprimeable number, because it can be changed into a prime (345161221) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 28763430 + ... + 28763441.
It is an arithmetic number, because the mean of its divisors is an integer number (86290308).
Almost surely, 2345161226 is an apocalyptic number.
345161226 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
345161226 is a wasteful number, since it uses less digits than its factorization.
345161226 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 57526876.
The product of its digits is 8640, while the sum is 30.
The square root of 345161226 is about 18578.5151721013. The cubic root of 345161226 is about 701.4671446014.
The spelling of 345161226 in words is "three hundred forty-five million, one hundred sixty-one thousand, two hundred twenty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •