Base | Representation |
---|---|
bin | 1110101101101001101… |
… | …01001001100101111101 |
3 | 1210022220022010011201021 |
4 | 13112310311021211331 |
5 | 31240324010133222 |
6 | 1024124423544141 |
7 | 51344606434063 |
oct | 7266465114575 |
9 | 1708808104637 |
10 | 505545005437 |
11 | 185444a8111a |
12 | 81b89bbb051 |
13 | 38898b8b694 |
14 | 1a67b834033 |
15 | d23c842ac7 |
hex | 75b4d4997d |
505545005437 has 4 divisors (see below), whose sum is σ = 508085432800. Its totient is φ = 503004578076.
The previous prime is 505545005411. The next prime is 505545005447. The reversal of 505545005437 is 734500545505.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 505545005437 - 211 = 505545003389 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 505545005393 and 505545005402.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (505545005447) 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 3 ways as a sum of consecutive naturals, for example, 1270213383 + ... + 1270213780.
It is an arithmetic number, because the mean of its divisors is an integer number (127021358200).
Almost surely, 2505545005437 is an apocalyptic number.
It is an amenable number.
505545005437 is a deficient number, since it is larger than the sum of its proper divisors (2540427363).
505545005437 is a wasteful number, since it uses less digits than its factorization.
505545005437 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2540427362.
The product of its (nonzero) digits is 1050000, while the sum is 43.
The spelling of 505545005437 in words is "five hundred five billion, five hundred forty-five million, five thousand, four hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •