Base | Representation |
---|---|
bin | 1110101101000010000… |
… | …10101100100010100101 |
3 | 1210022001011102011111222 |
4 | 13112201002230202211 |
5 | 31234134012342013 |
6 | 1024031444110125 |
7 | 51333435514424 |
oct | 7264102544245 |
9 | 1708034364458 |
10 | 505213012133 |
11 | 185294635695 |
12 | 81ab6995345 |
13 | 3884516b53b |
14 | 1a6496d32bb |
15 | d21d614508 |
hex | 75a10ac8a5 |
505213012133 has 4 divisors (see below), whose sum is σ = 505235970240. Its totient is φ = 505190054028.
The previous prime is 505213012123. The next prime is 505213012169. The reversal of 505213012133 is 331210312505.
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 a de Polignac number, because none of the positive numbers 2k-505213012133 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (505213012103) 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 3 ways as a sum of consecutive naturals, for example, 11446013 + ... + 11490066.
It is an arithmetic number, because the mean of its divisors is an integer number (126308992560).
Almost surely, 2505213012133 is an apocalyptic number.
It is an amenable number.
505213012133 is a deficient number, since it is larger than the sum of its proper divisors (22958107).
505213012133 is a wasteful number, since it uses less digits than its factorization.
505213012133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22958106.
The product of its (nonzero) digits is 2700, while the sum is 26.
Adding to 505213012133 its reverse (331210312505), we get a palindrome (836423324638).
The spelling of 505213012133 in words is "five hundred five billion, two hundred thirteen million, twelve thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •