Base | Representation |
---|---|
bin | 11111001001101… |
… | …11111000101010 |
3 | 200012201122120220 |
4 | 33210313320222 |
5 | 1013344334310 |
6 | 41533030510 |
7 | 6322135341 |
oct | 1744677052 |
9 | 605648526 |
10 | 261324330 |
11 | 124568923 |
12 | 73625436 |
13 | 421a8ca7 |
14 | 269c6b58 |
15 | 17e1e670 |
hex | f937e2a |
261324330 has 32 divisors (see below), whose sum is σ = 641767104. Its totient is φ = 68065536.
The previous prime is 261324319. The next prime is 261324341. The reversal of 261324330 is 33423162.
It is an interprime number because it is at equal distance from previous prime (261324319) and next prime (261324341).
It is a super-3 number, since 3×2613243303 (a number of 26 digits) contains 333 as substring.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 261324330.
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 15 ways as a sum of consecutive naturals, for example, 99999 + ... + 102578.
It is an arithmetic number, because the mean of its divisors is an integer number (20055222).
Almost surely, 2261324330 is an apocalyptic number.
261324330 is an abundant number, since it is smaller than the sum of its proper divisors (380442774).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
261324330 is a wasteful number, since it uses less digits than its factorization.
261324330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 202630.
The product of its (nonzero) digits is 2592, while the sum is 24.
The square root of 261324330 is about 16165.5290665044. The cubic root of 261324330 is about 639.3322543946.
Adding to 261324330 its reverse (33423162), we get a palindrome (294747492).
The spelling of 261324330 in words is "two hundred sixty-one million, three hundred twenty-four thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •