Base | Representation |
---|---|
bin | 11011111101111100… |
… | …10000000001001001 |
3 | 1102202102122122002101 |
4 | 31332332100001021 |
5 | 221222334242031 |
6 | 10521534433401 |
7 | 1041042444322 |
oct | 157676200111 |
9 | 42672578071 |
10 | 15015149641 |
11 | 640572a188 |
12 | 2ab0662861 |
13 | 1553a2183b |
14 | a26249449 |
15 | 5cd308361 |
hex | 37ef90049 |
15015149641 has 2 divisors, whose sum is σ = 15015149642. Its totient is φ = 15015149640.
The previous prime is 15015149579. The next prime is 15015149663. The reversal of 15015149641 is 14694151051.
It is a happy number.
15015149641 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11800259641 + 3214890000 = 108629^2 + 56700^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-15015149641 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 15015149641.
It is not a weakly prime, because it can be changed into another prime (15015149341) 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, 7507574820 + 7507574821.
It is an arithmetic number, because the mean of its divisors is an integer number (7507574821).
Almost surely, 215015149641 is an apocalyptic number.
It is an amenable number.
15015149641 is a deficient number, since it is larger than the sum of its proper divisors (1).
15015149641 is an equidigital number, since it uses as much as digits as its factorization.
15015149641 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 21600, while the sum is 37.
The spelling of 15015149641 in words is "fifteen billion, fifteen million, one hundred forty-nine thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •