Base | Representation |
---|---|
bin | 10100100101000… |
… | …010100101010111 |
3 | 220001122201202202 |
4 | 110211002211113 |
5 | 1201341113411 |
6 | 54131555115 |
7 | 11361420050 |
oct | 2445024527 |
9 | 801581682 |
10 | 345254231 |
11 | 167983683 |
12 | 9775ba9b |
13 | 566b405a |
14 | 33bd3727 |
15 | 2049c83b |
hex | 14942957 |
345254231 has 8 divisors (see below), whose sum is σ = 394690560. Its totient is φ = 295846488.
The previous prime is 345254179. The next prime is 345254233. The reversal of 345254231 is 132452543.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-345254231 is a prime.
It is a super-2 number, since 2×3452542312 = 238400968046802722, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 345254194 and 345254203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (345254233) 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 7 ways as a sum of consecutive naturals, for example, 36650 + ... + 45096.
It is an arithmetic number, because the mean of its divisors is an integer number (49336320).
Almost surely, 2345254231 is an apocalyptic number.
345254231 is a deficient number, since it is larger than the sum of its proper divisors (49436329).
345254231 is an equidigital number, since it uses as much as digits as its factorization.
345254231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14293.
The product of its digits is 14400, while the sum is 29.
The square root of 345254231 is about 18581.0180291608. The cubic root of 345254231 is about 701.5301432699.
The spelling of 345254231 in words is "three hundred forty-five million, two hundred fifty-four thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •