Base | Representation |
---|---|
bin | 111011011001… |
… | …0111001100100 |
3 | 2011121011002000 |
4 | 1312302321210 |
5 | 30433011401 |
6 | 3031245300 |
7 | 525461322 |
oct | 166627144 |
9 | 64534060 |
10 | 31141476 |
11 | 16640063 |
12 | a519830 |
13 | 65b4712 |
14 | 41c8d12 |
15 | 2b02186 |
hex | 1db2e64 |
31141476 has 96 divisors (see below), whose sum is σ = 85411200. Its totient is φ = 9797760.
The previous prime is 31141469. The next prime is 31141489. The reversal of 31141476 is 67414113.
It is a happy number.
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, 190971 + ... + 191133.
It is an arithmetic number, because the mean of its divisors is an integer number (889700).
Almost surely, 231141476 is an apocalyptic number.
31141476 is a gapful number since it is divisible by the number (36) 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 31141476, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (42705600).
31141476 is an abundant number, since it is smaller than the sum of its proper divisors (54269724).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
31141476 is a wasteful number, since it uses less digits than its factorization.
31141476 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 266 (or 258 counting only the distinct ones).
The product of its digits is 2016, while the sum is 27.
The square root of 31141476 is about 5580.4548201737. The cubic root of 31141476 is about 314.6152217878.
Adding to 31141476 its reverse (67414113), we get a palindrome (98555589).
The spelling of 31141476 in words is "thirty-one million, one hundred forty-one thousand, four hundred seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •