Base | Representation |
---|---|
bin | 1010000101000101110… |
… | …11111010110100000000 |
3 | 1020002221101212200122110 |
4 | 11002202323322310000 |
5 | 21133241214000224 |
6 | 423034031135320 |
7 | 34010255633310 |
oct | 5024273726400 |
9 | 1202841780573 |
10 | 346331000064 |
11 | 1239729033a5 |
12 | 57155674540 |
13 | 2687470cc4a |
14 | 12a96481440 |
15 | 901edb2929 |
hex | 50a2efad00 |
346331000064 has 288 divisors, whose sum is σ = 1134695890944. Its totient is φ = 91595243520.
The previous prime is 346331000053. The next prime is 346331000143. The reversal of 346331000064 is 460000133643.
It is a junction number, because it is equal to n+sod(n) for n = 346330999995 and 346331000040.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3787912 + ... + 3878264.
It is an arithmetic number, because the mean of its divisors is an integer number (3939916288).
Almost surely, 2346331000064 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 346331000064, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (567347945472).
346331000064 is an abundant number, since it is smaller than the sum of its proper divisors (788364890880).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
346331000064 is a wasteful number, since it uses less digits than its factorization.
346331000064 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 90433 (or 90419 counting only the distinct ones).
The product of its (nonzero) digits is 15552, while the sum is 30.
The spelling of 346331000064 in words is "three hundred forty-six billion, three hundred thirty-one million, sixty-four", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.109 sec. • engine limits •