Base | Representation |
---|---|
bin | 1110101101011000110… |
… | …00101000001110011101 |
3 | 1210022112102111100111100 |
4 | 13112230120220032131 |
5 | 31240031221423010 |
6 | 1024102402543313 |
7 | 51341236155555 |
oct | 7265430501635 |
9 | 1708472440440 |
10 | 505403311005 |
11 | 185381aa1a8a |
12 | 81b4a667b39 |
13 | 3887570a018 |
14 | 1a666aac165 |
15 | d2301a42c0 |
hex | 75ac62839d |
505403311005 has 24 divisors (see below), whose sum is σ = 876897274968. Its totient is φ = 269282318976.
The previous prime is 505403310989. The next prime is 505403311057. The reversal of 505403311005 is 500113304505.
505403311005 is a `hidden beast` number, since 5 + 0 + 540 + 3 + 3 + 110 + 0 + 5 = 666.
It can be written as a sum of positive squares in 4 ways, for example, as 27409451364 + 477993859641 = 165558^2 + 691371^2 .
It is not a de Polignac number, because 505403311005 - 24 = 505403310989 is a prime.
It is a super-2 number, since 2×5054033110052 (a number of 24 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 505403311005.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 5497942 + ... + 5589111.
It is an arithmetic number, because the mean of its divisors is an integer number (36537386457).
Almost surely, 2505403311005 is an apocalyptic number.
It is an amenable number.
505403311005 is a deficient number, since it is larger than the sum of its proper divisors (371493963963).
505403311005 is a wasteful number, since it uses less digits than its factorization.
505403311005 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11088077 (or 11088074 counting only the distinct ones).
The product of its (nonzero) digits is 4500, while the sum is 27.
The spelling of 505403311005 in words is "five hundred five billion, four hundred three million, three hundred eleven thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •