Base | Representation |
---|---|
bin | 1110100011011010101… |
… | …01010001100110111111 |
3 | 1202210201101020101021001 |
4 | 13101231111101212333 |
5 | 31143100412000111 |
6 | 1021415305351131 |
7 | 51061501055635 |
oct | 7215525214677 |
9 | 1683641211231 |
10 | 500050500031 |
11 | 18308551a965 |
12 | 80ab5a984a7 |
13 | 3820174c954 |
14 | 1a2b9c0b355 |
15 | d01a2ab1c1 |
hex | 746d5519bf |
500050500031 has 2 divisors, whose sum is σ = 500050500032. Its totient is φ = 500050500030.
The previous prime is 500050500029. The next prime is 500050500067. The reversal of 500050500031 is 130005050005.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 500050500031 - 21 = 500050500029 is a prime.
It is a super-2 number, since 2×5000505000312 (a number of 24 digits) contains 22 as substring.
Together with 500050500029, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 500050499981 and 500050500008.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (500050500091) 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 as a sum of consecutive naturals, namely, 250025250015 + 250025250016.
It is an arithmetic number, because the mean of its divisors is an integer number (250025250016).
Almost surely, 2500050500031 is an apocalyptic number.
500050500031 is a deficient number, since it is larger than the sum of its proper divisors (1).
500050500031 is an equidigital number, since it uses as much as digits as its factorization.
500050500031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 375, while the sum is 19.
Adding to 500050500031 its reverse (130005050005), we get a palindrome (630055550036).
The spelling of 500050500031 in words is "five hundred billion, fifty million, five hundred thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •