Base | Representation |
---|---|
bin | 10100100100010… |
… | …011010110100011 |
3 | 220001021220101120 |
4 | 110210103112203 |
5 | 1201313421041 |
6 | 54123503323 |
7 | 11356653036 |
oct | 2444232643 |
9 | 801256346 |
10 | 345060771 |
11 | 1678612a0 |
12 | 97687b43 |
13 | 56646c93 |
14 | 33b8301d |
15 | 20460366 |
hex | 149135a3 |
345060771 has 16 divisors (see below), whose sum is σ = 502917120. Its totient is φ = 208706720.
The previous prime is 345060761. The next prime is 345060811. The reversal of 345060771 is 177060543.
It is a cyclic number.
It is not a de Polignac number, because 345060771 - 25 = 345060739 is a prime.
It is a super-2 number, since 2×3450607712 = 238133871366228882, which contains 22 as substring.
It is a Smith number, since the sum of its digits (33) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is not an unprimeable number, because it can be changed into a prime (345060761) 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 15 ways as a sum of consecutive naturals, for example, 6526 + ... + 27068.
It is an arithmetic number, because the mean of its divisors is an integer number (31432320).
Almost surely, 2345060771 is an apocalyptic number.
345060771 is a deficient number, since it is larger than the sum of its proper divisors (157856349).
345060771 is a wasteful number, since it uses less digits than its factorization.
345060771 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21066.
The product of its (nonzero) digits is 17640, while the sum is 33.
The square root of 345060771 is about 18575.8114493015. The cubic root of 345060771 is about 701.3990868225.
The spelling of 345060771 in words is "three hundred forty-five million, sixty thousand, seven hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •