Base | Representation |
---|---|
bin | 100101111011100100011… |
… | …0010100101000000000001 |
3 | 200110101002100211220222101 |
4 | 1023313020302211000001 |
5 | 1140403024443011001 |
6 | 15030521113310401 |
7 | 1045432031065162 |
oct | 113671062450001 |
9 | 20411070756871 |
10 | 5213164032001 |
11 | 172a988209852 |
12 | 70241a105401 |
13 | 2ba7a3757b93 |
14 | 140465cd1769 |
15 | 909166e9a01 |
hex | 4bdc8ca5001 |
5213164032001 has 4 divisors (see below), whose sum is σ = 5213171192112. Its totient is φ = 5213156871892.
The previous prime is 5213164031839. The next prime is 5213164032017. The reversal of 5213164032001 is 1002304613125.
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 5213164032001 - 29 = 5213164031489 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5213164032071) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2346175 + ... + 3991348.
It is an arithmetic number, because the mean of its divisors is an integer number (1303292798028).
Almost surely, 25213164032001 is an apocalyptic number.
It is an amenable number.
5213164032001 is a deficient number, since it is larger than the sum of its proper divisors (7160111).
5213164032001 is an equidigital number, since it uses as much as digits as its factorization.
5213164032001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7160110.
The product of its (nonzero) digits is 4320, while the sum is 28.
Adding to 5213164032001 its reverse (1002304613125), we get a palindrome (6215468645126).
The spelling of 5213164032001 in words is "five trillion, two hundred thirteen billion, one hundred sixty-four million, thirty-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •