Base | Representation |
---|---|
bin | 1010011111010010… |
… | …11010111001011001 |
3 | 112112110010220001221 |
4 | 11033221122321121 |
5 | 43013043203213 |
6 | 2330440412041 |
7 | 256355424601 |
oct | 51751327131 |
9 | 15473126057 |
10 | 5631225433 |
11 | 242a753019 |
12 | 1111a77021 |
13 | 6b986b172 |
14 | 3b5c55c01 |
15 | 22e59138d |
hex | 14fa5ae59 |
5631225433 has 4 divisors (see below), whose sum is σ = 5762184208. Its totient is φ = 5500266660.
The previous prime is 5631225427. The next prime is 5631225437. The reversal of 5631225433 is 3345221365.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5631225433 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5631225437) 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 in 3 ways as a sum of consecutive naturals, for example, 65479323 + ... + 65479408.
It is an arithmetic number, because the mean of its divisors is an integer number (1440546052).
Almost surely, 25631225433 is an apocalyptic number.
It is an amenable number.
5631225433 is a deficient number, since it is larger than the sum of its proper divisors (130958775).
5631225433 is a wasteful number, since it uses less digits than its factorization.
5631225433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 130958774.
The product of its digits is 64800, while the sum is 34.
The square root of 5631225433 is about 75041.4914097528. The cubic root of 5631225433 is about 1779.1025051939.
Adding to 5631225433 its reverse (3345221365), we get a palindrome (8976446798).
The spelling of 5631225433 in words is "five billion, six hundred thirty-one million, two hundred twenty-five thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •