Base | Representation |
---|---|
bin | 1000110101101… |
… | …0010011110100 |
3 | 2120202100120111 |
4 | 2031122103310 |
5 | 33442220233 |
6 | 3402312404 |
7 | 630043000 |
oct | 215322364 |
9 | 76670514 |
10 | 37070068 |
11 | 19a1a322 |
12 | 104b8704 |
13 | 78ac069 |
14 | 4ccd700 |
15 | 33c3acd |
hex | 235a4f4 |
37070068 has 48 divisors (see below), whose sum is σ = 77616000. Its totient is φ = 15476160.
The previous prime is 37070063. The next prime is 37070069. The reversal of 37070068 is 86007073.
37070068 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (37070063) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 55923 + ... + 56581.
It is an arithmetic number, because the mean of its divisors is an integer number (1617000).
Almost surely, 237070068 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 37070068, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (38808000).
37070068 is an abundant number, since it is smaller than the sum of its proper divisors (40545932).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
37070068 is a wasteful number, since it uses less digits than its factorization.
37070068 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 725 (or 709 counting only the distinct ones).
The product of its (nonzero) digits is 7056, while the sum is 31.
The square root of 37070068 is about 6088.5193602386. The cubic root of 37070068 is about 333.4323967786.
The spelling of 37070068 in words is "thirty-seven million, seventy thousand, sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •