Base | Representation |
---|---|
bin | 111001011010110101110010… |
… | …0111110000000100010110111 |
3 | 2110020021212012122222012010201 |
4 | 1302311223210332000202313 |
5 | 1012200001112232304411 |
6 | 4550104115420101331 |
7 | 211245554622536125 |
oct | 16265534476004267 |
9 | 2406255178865121 |
10 | 505066225666231 |
11 | 136a25424380599 |
12 | 48791275094847 |
13 | 188a8704c536b8 |
14 | 8ca149b448915 |
15 | 3d5cde91d43c1 |
hex | 1cb5ae4f808b7 |
505066225666231 has 4 divisors (see below), whose sum is σ = 505884809500992. Its totient is φ = 504247641831472.
The previous prime is 505066225666217. The next prime is 505066225666243. The reversal of 505066225666231 is 132666522660505.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 505066225666231 - 243 = 496270132644023 is a prime.
It is a super-2 number, since 2×5050662256662312 (a number of 30 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (505066225660231) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 409291916455 + ... + 409291917688.
It is an arithmetic number, because the mean of its divisors is an integer number (126471202375248).
Almost surely, 2505066225666231 is an apocalyptic number.
505066225666231 is a deficient number, since it is larger than the sum of its proper divisors (818583834761).
505066225666231 is an equidigital number, since it uses as much as digits as its factorization.
505066225666231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 818583834760.
The product of its (nonzero) digits is 23328000, while the sum is 55.
The spelling of 505066225666231 in words is "five hundred five trillion, sixty-six billion, two hundred twenty-five million, six hundred sixty-six thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •