Base | Representation |
---|---|
bin | 1110101110100011100… |
… | …01110010010110111101 |
3 | 1210101011010222010210011 |
4 | 13113101301302112331 |
5 | 31242322322204401 |
6 | 1024244533143221 |
7 | 51362624444455 |
oct | 7272161622675 |
9 | 1711133863704 |
10 | 506030663101 |
11 | 185674131997 |
12 | 820a478ab11 |
13 | 38945691592 |
14 | 1a6c6134d65 |
15 | d26a2c6451 |
hex | 75d1c725bd |
506030663101 has 8 divisors (see below), whose sum is σ = 515022269600. Its totient is φ = 497061509040.
The previous prime is 506030663069. The next prime is 506030663111. The reversal of 506030663101 is 101366030605.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 506030663101 - 25 = 506030663069 is a prime.
It is a super-3 number, since 3×5060306631013 (a number of 36 digits) contains 333 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 (506030663111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5567631 + ... + 5657788.
It is an arithmetic number, because the mean of its divisors is an integer number (64377783700).
Almost surely, 2506030663101 is an apocalyptic number.
It is an amenable number.
506030663101 is a deficient number, since it is larger than the sum of its proper divisors (8991606499).
506030663101 is a wasteful number, since it uses less digits than its factorization.
506030663101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11226219.
The product of its (nonzero) digits is 9720, while the sum is 31.
Adding to 506030663101 its reverse (101366030605), we get a palindrome (607396693706).
The spelling of 506030663101 in words is "five hundred six billion, thirty million, six hundred sixty-three thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •