Base | Representation |
---|---|
bin | 11100001011101100… |
… | …00110000101010111 |
3 | 1110001110121121121122 |
4 | 32011312012011113 |
5 | 221441343433221 |
6 | 10541214034155 |
7 | 1043642502602 |
oct | 160566060527 |
9 | 43043547548 |
10 | 15130452311 |
11 | 6464822847 |
12 | 2b231a895b |
13 | 1571892680 |
14 | a376a1339 |
15 | 5d84d1eab |
hex | 385d86157 |
15130452311 has 8 divisors (see below), whose sum is σ = 16296527184. Its totient is φ = 13964690880.
The previous prime is 15130452307. The next prime is 15130452313. The reversal of 15130452311 is 11325403151.
15130452311 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 15130452311 - 22 = 15130452307 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (15130452313) 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 7 ways as a sum of consecutive naturals, for example, 27176 + ... + 176066.
It is an arithmetic number, because the mean of its divisors is an integer number (2037065898).
Almost surely, 215130452311 is an apocalyptic number.
15130452311 is a deficient number, since it is larger than the sum of its proper divisors (1166074873).
15130452311 is a wasteful number, since it uses less digits than its factorization.
15130452311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 156721.
The product of its (nonzero) digits is 1800, while the sum is 26.
Adding to 15130452311 its reverse (11325403151), we get a palindrome (26455855462).
The spelling of 15130452311 in words is "fifteen billion, one hundred thirty million, four hundred fifty-two thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •