Base | Representation |
---|---|
bin | 111100011011… |
… | …0010011100000 |
3 | 2012121111101200 |
4 | 1320312103200 |
5 | 31102222322 |
6 | 3051001200 |
7 | 533162451 |
oct | 170662340 |
9 | 65544350 |
10 | 31679712 |
11 | 16978489 |
12 | a739200 |
13 | 67426bc |
14 | 42c9128 |
15 | 2bab8ac |
hex | 1e364e0 |
31679712 has 72 divisors (see below), whose sum is σ = 90633816. Its totient is φ = 10496256.
The previous prime is 31679699. The next prime is 31679723. The reversal of 31679712 is 21797613.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (72).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 91123 + ... + 91469.
It is an arithmetic number, because the mean of its divisors is an integer number (1258803).
Almost surely, 231679712 is an apocalyptic number.
31679712 is a gapful number since it is divisible by the number (32) 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 31679712, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (45316908).
31679712 is an abundant number, since it is smaller than the sum of its proper divisors (58954104).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
31679712 is a wasteful number, since it uses less digits than its factorization.
31679712 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 680 (or 669 counting only the distinct ones).
The product of its digits is 15876, while the sum is 36.
The square root of 31679712 is about 5628.4733276440. The cubic root of 31679712 is about 316.4174368921.
The spelling of 31679712 in words is "thirty-one million, six hundred seventy-nine thousand, seven hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •