Base | Representation |
---|---|
bin | 1000111000100001110… |
… | …01100011011111010001 |
3 | 1002011211201221112210122 |
4 | 10130100321203133101 |
5 | 20000100401413131 |
6 | 352115144440025 |
7 | 31023534621146 |
oct | 4342071433721 |
9 | 1064751845718 |
10 | 305226201041 |
11 | 10849a262513 |
12 | 4b1a3779015 |
13 | 22a237b9568 |
14 | 10ab72863cd |
15 | 7e163e7d7b |
hex | 4710e637d1 |
305226201041 has 2 divisors, whose sum is σ = 305226201042. Its totient is φ = 305226201040.
The previous prime is 305226200959. The next prime is 305226201061. The reversal of 305226201041 is 140102622503.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 265332130816 + 39894070225 = 515104^2 + 199735^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-305226201041 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 305226201041.
It is not a weakly prime, because it can be changed into another prime (305226201061) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 152613100520 + 152613100521.
It is an arithmetic number, because the mean of its divisors is an integer number (152613100521).
Almost surely, 2305226201041 is an apocalyptic number.
It is an amenable number.
305226201041 is a deficient number, since it is larger than the sum of its proper divisors (1).
305226201041 is an equidigital number, since it uses as much as digits as its factorization.
305226201041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2880, while the sum is 26.
Adding to 305226201041 its reverse (140102622503), we get a palindrome (445328823544).
The spelling of 305226201041 in words is "three hundred five billion, two hundred twenty-six million, two hundred one thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •