Base | Representation |
---|---|
bin | 10101100001111… |
… | …101110010111001 |
3 | 221011201011002120 |
4 | 111201331302321 |
5 | 1214433203101 |
6 | 55502151453 |
7 | 11644236165 |
oct | 2541756271 |
9 | 834634076 |
10 | 361225401 |
11 | 1759a1a99 |
12 | a0b82589 |
13 | 59ab6754 |
14 | 35d8dca5 |
15 | 21aa4b36 |
hex | 1587dcb9 |
361225401 has 16 divisors (see below), whose sum is σ = 512827200. Its totient is φ = 225379328.
The previous prime is 361225391. The next prime is 361225411. The reversal of 361225401 is 104522163.
It is an interprime number because it is at equal distance from previous prime (361225391) and next prime (361225411).
It is a cyclic number.
It is not a de Polignac number, because 361225401 - 27 = 361225273 is a prime.
It is a super-2 number, since 2×3612254012 = 260967580655221602, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (361225411) by changing a digit.
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, 10656 + ... + 28913.
It is an arithmetic number, because the mean of its divisors is an integer number (32051700).
Almost surely, 2361225401 is an apocalyptic number.
It is an amenable number.
361225401 is a deficient number, since it is larger than the sum of its proper divisors (151601799).
361225401 is a wasteful number, since it uses less digits than its factorization.
361225401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39768.
The product of its (nonzero) digits is 1440, while the sum is 24.
The square root of 361225401 is about 19005.9306796589. The cubic root of 361225401 is about 712.1848987719.
Adding to 361225401 its reverse (104522163), we get a palindrome (465747564).
The spelling of 361225401 in words is "three hundred sixty-one million, two hundred twenty-five thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •