Base | Representation |
---|---|
bin | 10111001100101011101101… |
… | …10100101010000110010001 |
3 | 20200121211021222200101000121 |
4 | 23212111312310222012101 |
5 | 23141300234420340001 |
6 | 300255110135350241 |
7 | 13513406425156603 |
oct | 1346256664520621 |
9 | 220554258611017 |
10 | 51013320090001 |
11 | 1528869a304825 |
12 | 587a881822381 |
13 | 22606c64a3679 |
14 | c850b4add173 |
15 | 5d6e909a46a1 |
hex | 2e6576d2a191 |
51013320090001 has 2 divisors, whose sum is σ = 51013320090002. Its totient is φ = 51013320090000.
The previous prime is 51013320089993. The next prime is 51013320090011. The reversal of 51013320090001 is 10009002331015.
51013320090001 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 46641373643601 + 4371946446400 = 6829449^2 + 2090920^2 .
It is a cyclic number.
It is not a de Polignac number, because 51013320090001 - 23 = 51013320089993 is a prime.
It is not a weakly prime, because it can be changed into another prime (51013320090011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25506660045000 + 25506660045001.
It is an arithmetic number, because the mean of its divisors is an integer number (25506660045001).
Almost surely, 251013320090001 is an apocalyptic number.
It is an amenable number.
51013320090001 is a deficient number, since it is larger than the sum of its proper divisors (1).
51013320090001 is an equidigital number, since it uses as much as digits as its factorization.
51013320090001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 810, while the sum is 25.
The spelling of 51013320090001 in words is "fifty-one trillion, thirteen billion, three hundred twenty million, ninety thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •