Base | Representation |
---|---|
bin | 11100000000011110… |
… | …00011001010010001 |
3 | 1102210220111201221212 |
4 | 32000033003022101 |
5 | 221243300040031 |
6 | 10524012425505 |
7 | 1041420462443 |
oct | 160017031221 |
9 | 42726451855 |
10 | 15036330641 |
11 | 6416686842 |
12 | 2ab7778295 |
13 | 1558229687 |
14 | a28da0493 |
15 | 5d00de12b |
hex | 3803c3291 |
15036330641 has 2 divisors, whose sum is σ = 15036330642. Its totient is φ = 15036330640.
The previous prime is 15036330623. The next prime is 15036330689. The reversal of 15036330641 is 14603363051.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 14032771600 + 1003559041 = 118460^2 + 31679^2 .
It is an emirp because it is prime and its reverse (14603363051) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-15036330641 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 15036330598 and 15036330607.
It is not a weakly prime, because it can be changed into another prime (15036330691) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7518165320 + 7518165321.
It is an arithmetic number, because the mean of its divisors is an integer number (7518165321).
Almost surely, 215036330641 is an apocalyptic number.
It is an amenable number.
15036330641 is a deficient number, since it is larger than the sum of its proper divisors (1).
15036330641 is an equidigital number, since it uses as much as digits as its factorization.
15036330641 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 19440, while the sum is 32.
Adding to 15036330641 its reverse (14603363051), we get a palindrome (29639693692).
The spelling of 15036330641 in words is "fifteen billion, thirty-six million, three hundred thirty thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •