Base | Representation |
---|---|
bin | 11100001100110110… |
… | …11100001011001111 |
3 | 1110002011000222201102 |
4 | 32012123130023033 |
5 | 222001400222002 |
6 | 10542203533315 |
7 | 1044121635413 |
oct | 160633341317 |
9 | 43064028642 |
10 | 15140242127 |
11 | 646a2a9aaa |
12 | 2b2652a23b |
13 | 157390c66a |
14 | a38accd43 |
15 | 5d92b7a02 |
hex | 3866dc2cf |
15140242127 has 2 divisors, whose sum is σ = 15140242128. Its totient is φ = 15140242126.
The previous prime is 15140242111. The next prime is 15140242189. The reversal of 15140242127 is 72124204151.
It is a weak prime.
It is an emirp because it is prime and its reverse (72124204151) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 15140242127 - 24 = 15140242111 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 15140242127.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (15140242727) 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, 7570121063 + 7570121064.
It is an arithmetic number, because the mean of its divisors is an integer number (7570121064).
Almost surely, 215140242127 is an apocalyptic number.
15140242127 is a deficient number, since it is larger than the sum of its proper divisors (1).
15140242127 is an equidigital number, since it uses as much as digits as its factorization.
15140242127 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4480, while the sum is 29.
Adding to 15140242127 its reverse (72124204151), we get a palindrome (87264446278).
It can be divided in two parts, 1514024 and 2127, that added together give a palindrome (1516151).
The spelling of 15140242127 in words is "fifteen billion, one hundred forty million, two hundred forty-two thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •