Base | Representation |
---|---|
bin | 1001000000010011100… |
… | …00011001001000000001 |
3 | 1002120121201011212122101 |
4 | 10200021300121020001 |
5 | 20032123214413311 |
6 | 354045332110401 |
7 | 31232152610311 |
oct | 4401160311001 |
9 | 1076551155571 |
10 | 309401326081 |
11 | 10a241a89781 |
12 | 4bb69a65401 |
13 | 2323a795c53 |
14 | 10d91985441 |
15 | 80acc11ec1 |
hex | 4809c19201 |
309401326081 has 2 divisors, whose sum is σ = 309401326082. Its totient is φ = 309401326080.
The previous prime is 309401326049. The next prime is 309401326103. The reversal of 309401326081 is 180623104903.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 263981191681 + 45420134400 = 513791^2 + 213120^2 .
It is a cyclic number.
It is not a de Polignac number, because 309401326081 - 25 = 309401326049 is a prime.
It is a super-2 number, since 2×3094013260812 (a number of 24 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 309401326081.
It is not a weakly prime, because it can be changed into another prime (309401321081) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 154700663040 + 154700663041.
It is an arithmetic number, because the mean of its divisors is an integer number (154700663041).
Almost surely, 2309401326081 is an apocalyptic number.
It is an amenable number.
309401326081 is a deficient number, since it is larger than the sum of its proper divisors (1).
309401326081 is an equidigital number, since it uses as much as digits as its factorization.
309401326081 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 31104, while the sum is 37.
The spelling of 309401326081 in words is "three hundred nine billion, four hundred one million, three hundred twenty-six thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •