Base | Representation |
---|---|
bin | 11110001011110… |
… | …111100011111010 |
3 | 1022021221012010100 |
4 | 132023313203322 |
5 | 2014121141032 |
6 | 122130300230 |
7 | 15356364300 |
oct | 3613674372 |
9 | 1267835110 |
10 | 506427642 |
11 | 23a957646 |
12 | 121727676 |
13 | 80bc5936 |
14 | 4b38a270 |
15 | 2e6d797c |
hex | 1e2f78fa |
506427642 has 36 divisors (see below), whose sum is σ = 1276406586. Its totient is φ = 144693360.
The previous prime is 506427631. The next prime is 506427643. The reversal of 506427642 is 246724605.
506427642 is a `hidden beast` number, since 5 + 0 + 6 + 4 + 2 + 7 + 642 = 666.
It can be written as a sum of positive squares in only one way, i.e., 485276841 + 21150801 = 22029^2 + 4599^2 .
It is a junction number, because it is equal to n+sod(n) for n = 506427597 and 506427606.
It is not an unprimeable number, because it can be changed into a prime (506427643) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 286209 + ... + 287972.
Almost surely, 2506427642 is an apocalyptic number.
506427642 is an abundant number, since it is smaller than the sum of its proper divisors (769978944).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
506427642 is a wasteful number, since it uses less digits than its factorization.
506427642 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 574203 (or 574193 counting only the distinct ones).
The product of its (nonzero) digits is 80640, while the sum is 36.
The square root of 506427642 is about 22503.9472537597. The cubic root of 506427642 is about 797.0871371180.
The spelling of 506427642 in words is "five hundred six million, four hundred twenty-seven thousand, six hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.026 sec. • engine limits •