Base | Representation |
---|---|
bin | 1000000000000… |
… | …01100000111110 |
3 | 11200021210120100 |
4 | 10000001200332 |
5 | 114140140240 |
6 | 10354301530 |
7 | 1443316521 |
oct | 400014076 |
9 | 150253510 |
10 | 67115070 |
11 | 34980600 |
12 | 1a5878a6 |
13 | 10b9b679 |
14 | 8cb0bb8 |
15 | 5d5ae30 |
hex | 400183e |
67115070 has 72 divisors (see below), whose sum is σ = 191836008. Its totient is φ = 16267680.
The previous prime is 67115063. The next prime is 67115071. The reversal of 67115070 is 7051176.
It is a super-2 number, since 2×671150702 = 9008865242209800, which contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (67115071) by changing a digit.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 7809 + ... + 13971.
It is an arithmetic number, because the mean of its divisors is an integer number (2664389).
Almost surely, 267115070 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 67115070, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (95918004).
67115070 is an abundant number, since it is smaller than the sum of its proper divisors (124720938).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
67115070 is a wasteful number, since it uses less digits than its factorization.
67115070 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6198 (or 6184 counting only the distinct ones).
The product of its (nonzero) digits is 1470, while the sum is 27.
The square root of 67115070 is about 8192.3787754229. The cubic root of 67115070 is about 406.3871956345.
It can be divided in two parts, 6711 and 5070, that added together give a triangular number (11781 = T153).
The spelling of 67115070 in words is "sixty-seven million, one hundred fifteen thousand, seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •