Base | Representation |
---|---|
bin | 1111110010000110011000… |
… | …11000010010110000111110 |
3 | 11112212221020002210210200220 |
4 | 13321003030120102300332 |
5 | 14022113423224001222 |
6 | 201452022333002210 |
7 | 10211323661112000 |
oct | 771031430226076 |
9 | 145787202723626 |
10 | 34706764672062 |
11 | 1007106894358a |
12 | 3a864a1323366 |
13 | 1649aac004442 |
14 | 87db601b0370 |
15 | 402c08b6db5c |
hex | 1f90cc612c3e |
34706764672062 has 256 divisors, whose sum is σ = 83804751360000. Its totient is φ = 9573021739008.
The previous prime is 34706764672043. The next prime is 34706764672079. The reversal of 34706764672062 is 26027646760743.
It is a junction number, because it is equal to n+sod(n) for n = 34706764671987 and 34706764672005.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 3495489514 + ... + 3495499442.
It is an arithmetic number, because the mean of its divisors is an integer number (327362310000).
Almost surely, 234706764672062 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 34706764672062, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (41902375680000).
34706764672062 is an abundant number, since it is smaller than the sum of its proper divisors (49097986687938).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
34706764672062 is a wasteful number, since it uses less digits than its factorization.
34706764672062 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10520 (or 10506 counting only the distinct ones).
The product of its (nonzero) digits is 85349376, while the sum is 60.
The spelling of 34706764672062 in words is "thirty-four trillion, seven hundred six billion, seven hundred sixty-four million, six hundred seventy-two thousand, sixty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •