Base | Representation |
---|---|
bin | 1000000110000… |
… | …11110100110100 |
3 | 11201210020022220 |
4 | 10003003310310 |
5 | 114341122324 |
6 | 10423322340 |
7 | 1453143102 |
oct | 403036464 |
9 | 151706286 |
10 | 67910964 |
11 | 35374570 |
12 | 1a8b03b0 |
13 | 110b9a04 |
14 | 903ac72 |
15 | 5e66b79 |
hex | 40c3d34 |
67910964 has 48 divisors (see below), whose sum is σ = 174268416. Its totient is φ = 20412000.
The previous prime is 67910963. The next prime is 67910993. The reversal of 67910964 is 46901976.
It is a super-2 number, since 2×679109642 = 9223798062818592, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (67910963) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 14739 + ... + 18789.
It is an arithmetic number, because the mean of its divisors is an integer number (3630592).
Almost surely, 267910964 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 67910964, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (87134208).
67910964 is an abundant number, since it is smaller than the sum of its proper divisors (106357452).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
67910964 is a wasteful number, since it uses less digits than its factorization.
67910964 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4196 (or 4194 counting only the distinct ones).
The product of its (nonzero) digits is 81648, while the sum is 42.
The square root of 67910964 is about 8240.8108824314. The cubic root of 67910964 is about 407.9872881468.
The spelling of 67910964 in words is "sixty-seven million, nine hundred ten thousand, nine hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •