Base | Representation |
---|---|
bin | 11110000111101… |
… | …010101100101101 |
3 | 1022012212020110220 |
4 | 132013222230231 |
5 | 2013330421011 |
6 | 122050521553 |
7 | 15344126520 |
oct | 3607525455 |
9 | 1265766426 |
10 | 505326381 |
11 | 23a27520a |
12 | 1212962b9 |
13 | 808cb5c1 |
14 | 4b180bb7 |
15 | 2e56b506 |
hex | 1e1eab2d |
505326381 has 32 divisors (see below), whose sum is σ = 797147136. Its totient is φ = 278640000.
The previous prime is 505326373. The next prime is 505326389. The reversal of 505326381 is 183623505.
It is an interprime number because it is at equal distance from previous prime (505326373) and next prime (505326389).
It is not a de Polignac number, because 505326381 - 23 = 505326373 is a prime.
It is a super-2 number, since 2×5053263812 = 510709502669114322, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (505326389) 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 31 ways as a sum of consecutive naturals, for example, 279681 + ... + 281481.
It is an arithmetic number, because the mean of its divisors is an integer number (24910848).
Almost surely, 2505326381 is an apocalyptic number.
It is an amenable number.
505326381 is a deficient number, since it is larger than the sum of its proper divisors (291820755).
505326381 is a wasteful number, since it uses less digits than its factorization.
505326381 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2273.
The product of its (nonzero) digits is 21600, while the sum is 33.
The square root of 505326381 is about 22479.4657632249. The cubic root of 505326381 is about 796.5089445960.
Adding to 505326381 its reverse (183623505), we get a palindrome (688949886).
The spelling of 505326381 in words is "five hundred five million, three hundred twenty-six thousand, three hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •