Base | Representation |
---|---|
bin | 1110101110101100100… |
… | …01001011011001101001 |
3 | 1210101100101201200221202 |
4 | 13113112101023121221 |
5 | 31243001114013001 |
6 | 1024300224013545 |
7 | 51364531012466 |
oct | 7272621133151 |
9 | 1711311650852 |
10 | 506106001001 |
11 | 185702709417 |
12 | 82105a612b5 |
13 | 3895817b913 |
14 | 1a6d214666d |
15 | d271c0896b |
hex | 75d644b669 |
506106001001 has 8 divisors (see below), whose sum is σ = 524001285000. Its totient is φ = 488240273920.
The previous prime is 506106000973. The next prime is 506106001057. The reversal of 506106001001 is 100100601605.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 341938410025 + 164167590976 = 584755^2 + 405176^2 .
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 506106001001 - 226 = 506038892137 is a prime.
It is a super-2 number, since 2×5061060010012 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (506106001801) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7354376 + ... + 7422873.
It is an arithmetic number, because the mean of its divisors is an integer number (65500160625).
Almost surely, 2506106001001 is an apocalyptic number.
It is an amenable number.
506106001001 is a deficient number, since it is larger than the sum of its proper divisors (17895283999).
506106001001 is a wasteful number, since it uses less digits than its factorization.
506106001001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14778459.
The product of its (nonzero) digits is 180, while the sum is 20.
Adding to 506106001001 its reverse (100100601605), we get a palindrome (606206602606).
The spelling of 506106001001 in words is "five hundred six billion, one hundred six million, one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •