Base | Representation |
---|---|
bin | 111011111011… |
… | …1011100110100 |
3 | 2012010102020102 |
4 | 1313313130310 |
5 | 31021003020 |
6 | 3041253232 |
7 | 531041042 |
oct | 167673464 |
9 | 65112212 |
10 | 31422260 |
11 | 16812011 |
12 | a634218 |
13 | 668246c |
14 | 425d392 |
15 | 2b5a475 |
hex | 1df7734 |
31422260 has 12 divisors (see below), whose sum is σ = 65986788. Its totient is φ = 12568896.
The previous prime is 31422241. The next prime is 31422289. The reversal of 31422260 is 6222413.
It can be written as a sum of positive squares in 2 ways, for example, as 16875664 + 14546596 = 4108^2 + 3814^2 .
It is a Harshad number since it is a multiple of its sum of digits (20), and also a Moran number because the ratio is a prime number: 1571113 = 31422260 / (3 + 1 + 4 + 2 + 2 + 2 + 6 + 0).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 785537 + ... + 785576.
It is an arithmetic number, because the mean of its divisors is an integer number (5498899).
Almost surely, 231422260 is an apocalyptic number.
It is an amenable number.
31422260 is an abundant number, since it is smaller than the sum of its proper divisors (34564528).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
31422260 is a wasteful number, since it uses less digits than its factorization.
31422260 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1571122 (or 1571120 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 20.
The square root of 31422260 is about 5605.5561722277. The cubic root of 31422260 is about 315.5579596201.
Adding to 31422260 its reverse (6222413), we get a palindrome (37644673).
The spelling of 31422260 in words is "thirty-one million, four hundred twenty-two thousand, two hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •