Base | Representation |
---|---|
bin | 11100011110110000… |
… | …10110110011000001 |
3 | 1110110121122020211201 |
4 | 32033120112303001 |
5 | 222303322203414 |
6 | 11005130541201 |
7 | 1050624333031 |
oct | 161730266301 |
9 | 43417566751 |
10 | 15290428609 |
11 | 6537059365 |
12 | 2b68897801 |
13 | 1598a753c1 |
14 | a50a258c1 |
15 | 5e7582574 |
hex | 38f616cc1 |
15290428609 has 32 divisors (see below), whose sum is σ = 16933048704. Its totient is φ = 13746969600.
The previous prime is 15290428607. The next prime is 15290428627. The reversal of 15290428609 is 90682409251.
15290428609 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 not a de Polignac number, because 15290428609 - 21 = 15290428607 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (15290428607) 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 31 ways as a sum of consecutive naturals, for example, 21811959 + ... + 21812659.
It is an arithmetic number, because the mean of its divisors is an integer number (529157772).
Almost surely, 215290428609 is an apocalyptic number.
It is an amenable number.
15290428609 is a deficient number, since it is larger than the sum of its proper divisors (1642620095).
15290428609 is a wasteful number, since it uses less digits than its factorization.
15290428609 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1377.
The product of its (nonzero) digits is 311040, while the sum is 46.
The spelling of 15290428609 in words is "fifteen billion, two hundred ninety million, four hundred twenty-eight thousand, six hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •