Base | Representation |
---|---|
bin | 1110101110111011111… |
… | …01011011101000111001 |
3 | 1210101200101112200102101 |
4 | 13113131331123220321 |
5 | 31243232132323421 |
6 | 1024321113503401 |
7 | 51400655601406 |
oct | 7273575335071 |
9 | 1711611480371 |
10 | 506235042361 |
11 | 185769536074 |
12 | 82141111b61 |
13 | 38978b1cc59 |
14 | 1a7053372ad |
15 | d27d1e8191 |
hex | 75ddf5ba39 |
506235042361 has 8 divisors (see below), whose sum is σ = 506639600064. Its totient is φ = 505830586800.
The previous prime is 506235042337. The next prime is 506235042431. The reversal of 506235042361 is 163240532605.
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 506235042361 - 231 = 504087558713 is a prime.
It is a super-2 number, since 2×5062350423612 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 506235042361.
It is not an unprimeable number, because it can be changed into a prime (506235042331) 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, 12133386 + ... + 12175036.
It is an arithmetic number, because the mean of its divisors is an integer number (63329950008).
Almost surely, 2506235042361 is an apocalyptic number.
It is an amenable number.
506235042361 is a deficient number, since it is larger than the sum of its proper divisors (404557703).
506235042361 is a wasteful number, since it uses less digits than its factorization.
506235042361 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 51071.
The product of its (nonzero) digits is 129600, while the sum is 37.
Adding to 506235042361 its reverse (163240532605), we get a palindrome (669475574966).
The spelling of 506235042361 in words is "five hundred six billion, two hundred thirty-five million, forty-two thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •