Base | Representation |
---|---|
bin | 1001101101011111… |
… | …01110000011100101 |
3 | 111110100000111221102 |
4 | 10312233232003211 |
5 | 41134120240443 |
6 | 2221154125445 |
7 | 243123364052 |
oct | 46657560345 |
9 | 14410014842 |
10 | 5213446373 |
11 | 2235944473 |
12 | 1015b80885 |
13 | 651143315 |
14 | 376584029 |
15 | 207a69cb8 |
hex | 136bee0e5 |
5213446373 has 2 divisors, whose sum is σ = 5213446374. Its totient is φ = 5213446372.
The previous prime is 5213446369. The next prime is 5213446379. The reversal of 5213446373 is 3736443125.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5202304129 + 11142244 = 72127^2 + 3338^2 .
It is a cyclic number.
It is not a de Polignac number, because 5213446373 - 22 = 5213446369 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 (5213446379) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2606723186 + 2606723187.
It is an arithmetic number, because the mean of its divisors is an integer number (2606723187).
Almost surely, 25213446373 is an apocalyptic number.
It is an amenable number.
5213446373 is a deficient number, since it is larger than the sum of its proper divisors (1).
5213446373 is an equidigital number, since it uses as much as digits as its factorization.
5213446373 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 181440, while the sum is 38.
The square root of 5213446373 is about 72204.1991368923. The cubic root of 5213446373 is about 1733.9702297526.
Adding to 5213446373 its reverse (3736443125), we get a palindrome (8949889498).
The spelling of 5213446373 in words is "five billion, two hundred thirteen million, four hundred forty-six thousand, three hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •