Base | Representation |
---|---|
bin | 1110101100110010101… |
… | …11010110100000111101 |
3 | 1210021201012001022010110 |
4 | 13112121113112200331 |
5 | 31233403024143323 |
6 | 1024011003300233 |
7 | 51330312640623 |
oct | 7263127264075 |
9 | 1707635038113 |
10 | 505084209213 |
11 | 1852289610a1 |
12 | 81a7b81a679 |
13 | 388245818ac |
14 | 1a636565513 |
15 | d212170793 |
hex | 75995d683d |
505084209213 has 4 divisors (see below), whose sum is σ = 673445612288. Its totient is φ = 336722806140.
The previous prime is 505084209209. The next prime is 505084209221. The reversal of 505084209213 is 312902480505.
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 not a de Polignac number, because 505084209213 - 22 = 505084209209 is a prime.
It is a super-2 number, since 2×5050842092132 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (505084609213) 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, 84180701533 + ... + 84180701538.
It is an arithmetic number, because the mean of its divisors is an integer number (168361403072).
Almost surely, 2505084209213 is an apocalyptic number.
It is an amenable number.
505084209213 is a deficient number, since it is larger than the sum of its proper divisors (168361403075).
505084209213 is a wasteful number, since it uses less digits than its factorization.
505084209213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 168361403074.
The product of its (nonzero) digits is 86400, while the sum is 39.
Adding to 505084209213 its reverse (312902480505), we get a palindrome (817986689718).
The spelling of 505084209213 in words is "five hundred five billion, eighty-four million, two hundred nine thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •