Base | Representation |
---|---|
bin | 10100101010101… |
… | …010001011100110 |
3 | 220011102120020000 |
4 | 110222222023212 |
5 | 1202230232032 |
6 | 54223322130 |
7 | 11410063206 |
oct | 2452521346 |
9 | 804376200 |
10 | 346727142 |
11 | 16879a263 |
12 | 98150346 |
13 | 56aab5b8 |
14 | 34098406 |
15 | 2068de7c |
hex | 14aaa2e6 |
346727142 has 40 divisors (see below), whose sum is σ = 784654992. Its totient is φ = 114426000.
The previous prime is 346727141. The next prime is 346727159. The reversal of 346727142 is 241727643.
346727142 is a `hidden beast` number, since 346 + 7 + 271 + 42 = 666.
It is a junction number, because it is equal to n+sod(n) for n = 346727097 and 346727106.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (346727141) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 5767 + ... + 26957.
Almost surely, 2346727142 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 346727142, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (392327496).
346727142 is an abundant number, since it is smaller than the sum of its proper divisors (437927850).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
346727142 is a wasteful number, since it uses less digits than its factorization.
346727142 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 21306 (or 21297 counting only the distinct ones).
The product of its digits is 56448, while the sum is 36.
The square root of 346727142 is about 18620.6106774187. The cubic root of 346727142 is about 702.5263420592.
It can be divided in two parts, 34672 and 7142, that added together give a palindrome (41814).
The spelling of 346727142 in words is "three hundred forty-six million, seven hundred twenty-seven thousand, one hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •