Base | Representation |
---|---|
bin | 11110000111110… |
… | …001101100100001 |
3 | 1022012220200210101 |
4 | 132013301230201 |
5 | 2013332330131 |
6 | 122051302401 |
7 | 15344306212 |
oct | 3607615441 |
9 | 1265820711 |
10 | 505355041 |
11 | 23a2947a4 |
12 | 1212aaa01 |
13 | 8090b669 |
14 | 4b18b409 |
15 | 2e574c61 |
hex | 1e1f1b21 |
505355041 has 4 divisors (see below), whose sum is σ = 505400112. Its totient is φ = 505309972.
The previous prime is 505355033. The next prime is 505355047. The reversal of 505355041 is 140553505.
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, and also a brilliant number, because the two primes have the same length, and also an emirpimes, since its reverse is a distinct semiprime: 140553505 = 5 ⋅28110701.
It is a cyclic number.
It is not a de Polignac number, because 505355041 - 23 = 505355033 is a prime.
It is a super-2 number, since 2×5053550412 = 510767434928223362, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (505355047) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8910 + ... + 33016.
It is an arithmetic number, because the mean of its divisors is an integer number (126350028).
Almost surely, 2505355041 is an apocalyptic number.
It is an amenable number.
505355041 is a deficient number, since it is larger than the sum of its proper divisors (45071).
505355041 is a wasteful number, since it uses less digits than its factorization.
505355041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45070.
The product of its (nonzero) digits is 7500, while the sum is 28.
The square root of 505355041 is about 22480.1032248520. The cubic root of 505355041 is about 796.5240025306.
The spelling of 505355041 in words is "five hundred five million, three hundred fifty-five thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •