Base | Representation |
---|---|
bin | 1010000000110110… |
… | …11100010111101101 |
3 | 111212122201011211102 |
4 | 11000123130113231 |
5 | 42002212400323 |
6 | 2245240132445 |
7 | 250135265132 |
oct | 50033342755 |
9 | 14778634742 |
10 | 5375903213 |
11 | 230961471a |
12 | 1060467125 |
13 | 6789b4125 |
14 | 38dd92589 |
15 | 216e5a328 |
hex | 1406dc5ed |
5375903213 has 2 divisors, whose sum is σ = 5375903214. Its totient is φ = 5375903212.
The previous prime is 5375903209. The next prime is 5375903219. The reversal of 5375903213 is 3123095735.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4670628964 + 705274249 = 68342^2 + 26557^2 .
It is a cyclic number.
It is not a de Polignac number, because 5375903213 - 22 = 5375903209 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5375903219) 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, 2687951606 + 2687951607.
It is an arithmetic number, because the mean of its divisors is an integer number (2687951607).
Almost surely, 25375903213 is an apocalyptic number.
It is an amenable number.
5375903213 is a deficient number, since it is larger than the sum of its proper divisors (1).
5375903213 is an equidigital number, since it uses as much as digits as its factorization.
5375903213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 85050, while the sum is 38.
The square root of 5375903213 is about 73320.5510958558. The cubic root of 5375903213 is about 1751.7971429824.
Adding to 5375903213 its reverse (3123095735), we get a palindrome (8498998948).
The spelling of 5375903213 in words is "five billion, three hundred seventy-five million, nine hundred three thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •