Base | Representation |
---|---|
bin | 1001101110100011… |
… | …00011000000010001 |
3 | 111110221201001001002 |
4 | 10313101203000101 |
5 | 41143403022001 |
6 | 2222112151345 |
7 | 243261636152 |
oct | 46721430021 |
9 | 14427631032 |
10 | 5222314001 |
11 | 223a950893 |
12 | 1018b38555 |
13 | 652c29638 |
14 | 377811929 |
15 | 20871c46b |
hex | 137463011 |
5222314001 has 4 divisors (see below), whose sum is σ = 5228950512. Its totient is φ = 5215677492.
The previous prime is 5222313991. The next prime is 5222314021. The reversal of 5222314001 is 1004132225.
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 not a de Polignac number, because 5222314001 - 26 = 5222313937 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5222314021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3317075 + ... + 3318648.
It is an arithmetic number, because the mean of its divisors is an integer number (1307237628).
Almost surely, 25222314001 is an apocalyptic number.
It is an amenable number.
5222314001 is a deficient number, since it is larger than the sum of its proper divisors (6636511).
5222314001 is an equidigital number, since it uses as much as digits as its factorization.
5222314001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6636510.
The product of its (nonzero) digits is 480, while the sum is 20.
The square root of 5222314001 is about 72265.5796420398. The cubic root of 5222314001 is about 1734.9527847472.
Adding to 5222314001 its reverse (1004132225), we get a palindrome (6226446226).
The spelling of 5222314001 in words is "five billion, two hundred twenty-two million, three hundred fourteen thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •