Base | Representation |
---|---|
bin | 1010011111010010… |
… | …11010001010011111 |
3 | 112112110010201221202 |
4 | 11033221122022133 |
5 | 43013043104211 |
6 | 2330440350115 |
7 | 256355413052 |
oct | 51751321237 |
9 | 15473121852 |
10 | 5631222431 |
11 | 242a75083a |
12 | 1111a7533b |
13 | 6b98699a3 |
14 | 3b5c54a99 |
15 | 22e59053b |
hex | 14fa5a29f |
5631222431 has 2 divisors, whose sum is σ = 5631222432. Its totient is φ = 5631222430.
The previous prime is 5631222427. The next prime is 5631222479. The reversal of 5631222431 is 1342221365.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 5631222431 - 22 = 5631222427 is a prime.
It is a super-2 number, since 2×56312224312 = 63421332134795099522, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 5631222394 and 5631222403.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5631222481) 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, 2815611215 + 2815611216.
It is an arithmetic number, because the mean of its divisors is an integer number (2815611216).
Almost surely, 25631222431 is an apocalyptic number.
5631222431 is a deficient number, since it is larger than the sum of its proper divisors (1).
5631222431 is an equidigital number, since it uses as much as digits as its factorization.
5631222431 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 8640, while the sum is 29.
The square root of 5631222431 is about 75041.4714074824. The cubic root of 5631222431 is about 1779.1021890480.
Adding to 5631222431 its reverse (1342221365), we get a palindrome (6973443796).
The spelling of 5631222431 in words is "five billion, six hundred thirty-one million, two hundred twenty-two thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •