Base | Representation |
---|---|
bin | 1001011010000111… |
… | …01110100100101101 |
3 | 111001000012021120222 |
4 | 10231003232210231 |
5 | 40321013403323 |
6 | 2153110421125 |
7 | 236111050664 |
oct | 45503564455 |
9 | 14030167528 |
10 | 5050919213 |
11 | 21621263aa |
12 | b8b6617a5 |
13 | 6265794c2 |
14 | 35cb57ddb |
15 | 1e86639c8 |
hex | 12d0ee92d |
5050919213 has 2 divisors, whose sum is σ = 5050919214. Its totient is φ = 5050919212.
The previous prime is 5050919179. The next prime is 5050919219. The reversal of 5050919213 is 3129190505.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4899580009 + 151339204 = 69997^2 + 12302^2 .
It is a cyclic number.
It is not a de Polignac number, because 5050919213 - 26 = 5050919149 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5050919219) 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 as a sum of consecutive naturals, namely, 2525459606 + 2525459607.
It is an arithmetic number, because the mean of its divisors is an integer number (2525459607).
Almost surely, 25050919213 is an apocalyptic number.
It is an amenable number.
5050919213 is a deficient number, since it is larger than the sum of its proper divisors (1).
5050919213 is an equidigital number, since it uses as much as digits as its factorization.
5050919213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12150, while the sum is 35.
The square root of 5050919213 is about 71069.8192835749. The cubic root of 5050919213 is about 1715.7610612927.
The spelling of 5050919213 in words is "five billion, fifty million, nine hundred nineteen thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •