Base | Representation |
---|---|
bin | 11101000010010111… |
… | …01101110000101001 |
3 | 1111020102122120101110 |
4 | 32201023231300221 |
5 | 223411302322211 |
6 | 11054520340533 |
7 | 1061212126533 |
oct | 164113556051 |
9 | 44212576343 |
10 | 15589104681 |
11 | 667a709097 |
12 | 3030914749 |
13 | 16158cb6c7 |
14 | a7c572853 |
15 | 6138cdea6 |
hex | 3a12edc29 |
15589104681 has 16 divisors (see below), whose sum is σ = 21241721600. Its totient is φ = 10167026688.
The previous prime is 15589104653. The next prime is 15589104689. The reversal of 15589104681 is 18640198551.
15589104681 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 15589104681 - 29 = 15589104169 is a prime.
It is a super-2 number, since 2×155891046812 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 15589104681.
It is not an unprimeable number, because it can be changed into a prime (15589104689) 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, 275896 + ... + 327561.
It is an arithmetic number, because the mean of its divisors is an integer number (1327607600).
Almost surely, 215589104681 is an apocalyptic number.
It is an amenable number.
15589104681 is a deficient number, since it is larger than the sum of its proper divisors (5652616919).
15589104681 is a wasteful number, since it uses less digits than its factorization.
15589104681 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 603648.
The product of its (nonzero) digits is 345600, while the sum is 48.
The spelling of 15589104681 in words is "fifteen billion, five hundred eighty-nine million, one hundred four thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •