Base | Representation |
---|---|
bin | 10100100101010… |
… | …000111111000111 |
3 | 220001202201200122 |
4 | 110211100333013 |
5 | 1201400010343 |
6 | 54133132155 |
7 | 11362054043 |
oct | 2445207707 |
9 | 801681618 |
10 | 345313223 |
11 | 167a13a32 |
12 | 9778a05b |
13 | 56704b68 |
14 | 33c0b023 |
15 | 204b0068 |
hex | 14950fc7 |
345313223 has 8 divisors (see below), whose sum is σ = 348601968. Its totient is φ = 342040384.
The previous prime is 345313217. The next prime is 345313229. The reversal of 345313223 is 322313543.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (345313217) and next prime (345313229).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 345313223 - 212 = 345309127 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 345313192 and 345313201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (345313229) 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, 42140 + ... + 49662.
It is an arithmetic number, because the mean of its divisors is an integer number (43575246).
Almost surely, 2345313223 is an apocalyptic number.
345313223 is a deficient number, since it is larger than the sum of its proper divisors (3288745).
345313223 is a wasteful number, since it uses less digits than its factorization.
345313223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7953.
The product of its digits is 6480, while the sum is 26.
The square root of 345313223 is about 18582.6053878352. The cubic root of 345313223 is about 701.5700967357.
Adding to 345313223 its reverse (322313543), we get a palindrome (667626766).
The spelling of 345313223 in words is "three hundred forty-five million, three hundred thirteen thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •