Base | Representation |
---|---|
bin | 1001111010011101… |
… | …00101101000011111 |
3 | 111201220122212002221 |
4 | 10331032211220133 |
5 | 41344440423011 |
6 | 2240041130211 |
7 | 245613652555 |
oct | 47516455037 |
9 | 14656585087 |
10 | 5322201631 |
11 | 229127594a |
12 | 1046489967 |
13 | 66a830c46 |
14 | 386bb3bd5 |
15 | 21239d971 |
hex | 13d3a5a1f |
5322201631 has 2 divisors, whose sum is σ = 5322201632. Its totient is φ = 5322201630.
The previous prime is 5322201623. The next prime is 5322201671. The reversal of 5322201631 is 1361022235.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 5322201631 - 23 = 5322201623 is a prime.
It is a super-2 number, since 2×53222016312 = 56651660402038120322, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 5322201596 and 5322201605.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5322201671) 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, 2661100815 + 2661100816.
It is an arithmetic number, because the mean of its divisors is an integer number (2661100816).
Almost surely, 25322201631 is an apocalyptic number.
5322201631 is a deficient number, since it is larger than the sum of its proper divisors (1).
5322201631 is an equidigital number, since it uses as much as digits as its factorization.
5322201631 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2160, while the sum is 25.
The square root of 5322201631 is about 72953.4209684508. The cubic root of 5322201631 is about 1745.9445280788.
Adding to 5322201631 its reverse (1361022235), we get a palindrome (6683223866).
The spelling of 5322201631 in words is "five billion, three hundred twenty-two million, two hundred one thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •