Base | Representation |
---|---|
bin | 11100000000111101… |
… | …10000111101011001 |
3 | 1102211012021001012021 |
4 | 32000132300331121 |
5 | 221300323403033 |
6 | 10524241014441 |
7 | 1041500501413 |
oct | 160036607531 |
9 | 42735231167 |
10 | 15040450393 |
11 | 6418a3aaa1 |
12 | 2ab9024421 |
13 | 155903c8b7 |
14 | a297539b3 |
15 | 5d0654b2d |
hex | 3807b0f59 |
15040450393 has 2 divisors, whose sum is σ = 15040450394. Its totient is φ = 15040450392.
The previous prime is 15040450343. The next prime is 15040450427. The reversal of 15040450393 is 39305404051.
15040450393 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an a-pointer prime, because the next prime (15040450427) can be obtained adding 15040450393 to its sum of digits (34).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 14746944969 + 293505424 = 121437^2 + 17132^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-15040450393 is a prime.
It is not a weakly prime, because it can be changed into another prime (15040450343) 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, 7520225196 + 7520225197.
It is an arithmetic number, because the mean of its divisors is an integer number (7520225197).
Almost surely, 215040450393 is an apocalyptic number.
It is an amenable number.
15040450393 is a deficient number, since it is larger than the sum of its proper divisors (1).
15040450393 is an equidigital number, since it uses as much as digits as its factorization.
15040450393 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 32400, while the sum is 34.
The spelling of 15040450393 in words is "fifteen billion, forty million, four hundred fifty thousand, three hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •