Base | Representation |
---|---|
bin | 1000000000000… |
… | …00100110001100 |
3 | 11200021121102000 |
4 | 10000000212030 |
5 | 114140030213 |
6 | 10354232300 |
7 | 1443302535 |
oct | 400004614 |
9 | 150247360 |
10 | 67111308 |
11 | 349787a0 |
12 | 1a585690 |
13 | 10b99a44 |
14 | 8cad68c |
15 | 5d59c73 |
hex | 400098c |
67111308 has 96 divisors (see below), whose sum is σ = 201035520. Its totient is φ = 19134720.
The previous prime is 67111277. The next prime is 67111321. The reversal of 67111308 is 80311176.
It is a super-2 number, since 2×671113082 = 9007855322941728, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 18535 + ... + 21857.
It is an arithmetic number, because the mean of its divisors is an integer number (2094120).
Almost surely, 267111308 is an apocalyptic number.
67111308 is a gapful number since it is divisible by the number (68) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 67111308, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (100517760).
67111308 is an abundant number, since it is smaller than the sum of its proper divisors (133924212).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
67111308 is a wasteful number, since it uses less digits than its factorization.
67111308 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3364 (or 3356 counting only the distinct ones).
The product of its (nonzero) digits is 1008, while the sum is 27.
The square root of 67111308 is about 8192.1491685638. The cubic root of 67111308 is about 406.3796024209.
The spelling of 67111308 in words is "sixty-seven million, one hundred eleven thousand, three hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.021 sec. • engine limits •