Base | Representation |
---|---|
bin | 111001100010011100110100… |
… | …1001100111000101011010101 |
3 | 2110100222211211220221212222121 |
4 | 1303010321221030320223111 |
5 | 1012314120111012232410 |
6 | 4552224410531255541 |
7 | 211414252113146656 |
oct | 16304715114705325 |
9 | 2410884756855877 |
10 | 506112121211605 |
11 | 137298a44120a77 |
12 | 4891bb0544a5b1 |
13 | 1895322582727c |
14 | 8cd9d5903b52d |
15 | 3d7a20ecd59da |
hex | 1cc4e69338ad5 |
506112121211605 has 32 divisors (see below), whose sum is σ = 638003196885600. Its totient is φ = 384918968448000.
The previous prime is 506112121211603. The next prime is 506112121211623.
506112121211605 is nontrivially palindromic in base 10.
It can be written as a sum of positive squares in 16 ways, for example, as 52649448928036 + 453462672283569 = 7255994^2 + 21294663^2 .
It is not a de Polignac number, because 506112121211605 - 21 = 506112121211603 is a prime.
It is a super-2 number, since 2×5061121212116052 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (506112121211603) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 92815270 + ... + 98116759.
It is an arithmetic number, because the mean of its divisors is an integer number (19937599902675).
Almost surely, 2506112121211605 is an apocalyptic number.
It is an amenable number.
506112121211605 is a deficient number, since it is larger than the sum of its proper divisors (131891075673995).
506112121211605 is a wasteful number, since it uses less digits than its factorization.
506112121211605 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 190932345.
The product of its (nonzero) digits is 7200, while the sum is 34.
The spelling of 506112121211605 in words is "five hundred six trillion, one hundred twelve billion, one hundred twenty-one million, two hundred eleven thousand, six hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •