Base | Representation |
---|---|
bin | 11100101100011000… |
… | …11000011010111001 |
3 | 1110202120201100221002 |
4 | 32112030120122321 |
5 | 223022102330131 |
6 | 11024332454345 |
7 | 1053513021251 |
oct | 162614303271 |
9 | 43676640832 |
10 | 15404730041 |
11 | 6595628758 |
12 | 2b9b01a3b5 |
13 | 15b665559c |
14 | a61c9a961 |
15 | 60260e6cb |
hex | 3963186b9 |
15404730041 has 2 divisors, whose sum is σ = 15404730042. Its totient is φ = 15404730040.
The previous prime is 15404730037. The next prime is 15404730101. The reversal of 15404730041 is 14003740451.
It is a happy number.
15404730041 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., 10505430016 + 4899300025 = 102496^2 + 69995^2 .
It is a cyclic number.
It is not a de Polignac number, because 15404730041 - 22 = 15404730037 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 15404729986 and 15404730013.
It is not a weakly prime, because it can be changed into another prime (15404730641) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7702365020 + 7702365021.
It is an arithmetic number, because the mean of its divisors is an integer number (7702365021).
Almost surely, 215404730041 is an apocalyptic number.
It is an amenable number.
15404730041 is a deficient number, since it is larger than the sum of its proper divisors (1).
15404730041 is an equidigital number, since it uses as much as digits as its factorization.
15404730041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6720, while the sum is 29.
The spelling of 15404730041 in words is "fifteen billion, four hundred four million, seven hundred thirty thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •