Base | Representation |
---|---|
bin | 100110101110011100110… |
… | …1000001001010111110001 |
3 | 200211211010101111112010211 |
4 | 1031130321220021113301 |
5 | 1144200314403231301 |
6 | 15153031410224121 |
7 | 1056350544430663 |
oct | 115347150112761 |
9 | 20754111445124 |
10 | 5322431305201 |
11 | 177225979741a |
12 | 71b633585041 |
13 | 2c7b981c751a |
14 | 14586da5c533 |
15 | 936ae308051 |
hex | 4d739a095f1 |
5322431305201 has 4 divisors (see below), whose sum is σ = 5340596600052. Its totient is φ = 5304266010352.
The previous prime is 5322431305187. The next prime is 5322431305363. The reversal of 5322431305201 is 1025031342235.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 5201204778225 + 121226526976 = 2280615^2 + 348176^2 .
It is a cyclic number.
It is not a de Polignac number, because 5322431305201 - 211 = 5322431303153 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5322431305501) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 9082646986 + ... + 9082647571.
It is an arithmetic number, because the mean of its divisors is an integer number (1335149150013).
Almost surely, 25322431305201 is an apocalyptic number.
It is an amenable number.
5322431305201 is a deficient number, since it is larger than the sum of its proper divisors (18165294851).
5322431305201 is a wasteful number, since it uses less digits than its factorization.
5322431305201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 18165294850.
The product of its (nonzero) digits is 21600, while the sum is 31.
Adding to 5322431305201 its reverse (1025031342235), we get a palindrome (6347462647436).
The spelling of 5322431305201 in words is "five trillion, three hundred twenty-two billion, four hundred thirty-one million, three hundred five thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •