Base | Representation |
---|---|
bin | 1110101101000100010… |
… | …00010001101101110101 |
3 | 1210022002102201212101020 |
4 | 13112202020101231311 |
5 | 31234203200033331 |
6 | 1024033335051353 |
7 | 51334046534034 |
oct | 7264210215565 |
9 | 1708072655336 |
10 | 505231252341 |
11 | 1852a3963842 |
12 | 81b00b10b59 |
13 | 38848b8696a |
14 | 1a64bcc071b |
15 | d220018c96 |
hex | 75a2211b75 |
505231252341 has 8 divisors (see below), whose sum is σ = 673993816320. Its totient is φ = 336644761632.
The previous prime is 505231252289. The next prime is 505231252363. The reversal of 505231252341 is 143252132505.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 505231252341 - 27 = 505231252213 is a prime.
It is a super-3 number, since 3×5052312523413 (a number of 36 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (505231252391) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 44011621 + ... + 44023098.
It is an arithmetic number, because the mean of its divisors is an integer number (84249227040).
Almost surely, 2505231252341 is an apocalyptic number.
It is an amenable number.
505231252341 is a deficient number, since it is larger than the sum of its proper divisors (168762563979).
505231252341 is a wasteful number, since it uses less digits than its factorization.
505231252341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 88036635.
The product of its (nonzero) digits is 36000, while the sum is 33.
Adding to 505231252341 its reverse (143252132505), we get a palindrome (648483384846).
The spelling of 505231252341 in words is "five hundred five billion, two hundred thirty-one million, two hundred fifty-two thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •