Base | Representation |
---|---|
bin | 11100001111001001… |
… | …00001101001010111 |
3 | 1110010111002100211001 |
4 | 32013210201221113 |
5 | 222021301313142 |
6 | 10544130324131 |
7 | 1044443532340 |
oct | 160744415127 |
9 | 43114070731 |
10 | 15159401047 |
11 | 647a0a541a |
12 | 2b30a29647 |
13 | 1577889cbb |
14 | a3b4790c7 |
15 | 5dacee5b7 |
hex | 387921a57 |
15159401047 has 16 divisors (see below), whose sum is σ = 18825164800. Its totient is φ = 11912793120.
The previous prime is 15159401027. The next prime is 15159401063. The reversal of 15159401047 is 74010495151.
15159401047 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-15159401047 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 15159400997 and 15159401015.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (15159401027) 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 in 15 ways as a sum of consecutive naturals, for example, 1834272 + ... + 1842517.
It is an arithmetic number, because the mean of its divisors is an integer number (1176572800).
Almost surely, 215159401047 is an apocalyptic number.
15159401047 is a deficient number, since it is larger than the sum of its proper divisors (3665763753).
15159401047 is a wasteful number, since it uses less digits than its factorization.
15159401047 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3676846.
The product of its (nonzero) digits is 25200, while the sum is 37.
Adding to 15159401047 its reverse (74010495151), we get a palindrome (89169896198).
The spelling of 15159401047 in words is "fifteen billion, one hundred fifty-nine million, four hundred one thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •