Base | Representation |
---|---|
bin | 1110101101001001011… |
… | …01110000000100110000 |
3 | 1210022012110100200221210 |
4 | 13112210231300010300 |
5 | 31234300301133243 |
6 | 1024041524520120 |
7 | 51335114331600 |
oct | 7264455600460 |
9 | 1708173320853 |
10 | 505274630448 |
11 | 1853163a1415 |
12 | 81b13550040 |
13 | 38854b63c93 |
14 | 1a653972c00 |
15 | d223c36933 |
hex | 75a4b70130 |
505274630448 has 90 divisors (see below), whose sum is σ = 1518505425876. Its totient is φ = 144354330624.
The previous prime is 505274630431. The next prime is 505274630449. The reversal of 505274630448 is 844036472505.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a junction number, because it is equal to n+sod(n) for n = 505274630397 and 505274630406.
It is not an unprimeable number, because it can be changed into a prime (505274630449) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 34465936 + ... + 34480592.
Almost surely, 2505274630448 is an apocalyptic number.
It is an amenable number.
505274630448 is an abundant number, since it is smaller than the sum of its proper divisors (1013230795428).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
505274630448 is an frugal number, since it uses more digits than its factorization.
505274630448 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29339 (or 14669 counting only the distinct ones).
The product of its (nonzero) digits is 3225600, while the sum is 48.
Multiplying 505274630448 by its sum of digits (48), we get a square (24253182261504 = 49247522).
505274630448 divided by its sum of digits (48) gives a square (10526554801 = 1025992).
The spelling of 505274630448 in words is "five hundred five billion, two hundred seventy-four million, six hundred thirty thousand, four hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •