Base | Representation |
---|---|
bin | 11100101101010000… |
… | …00010101011100001 |
3 | 1110210002100202102001 |
4 | 32112220002223201 |
5 | 223030431343100 |
6 | 11025152124001 |
7 | 1053631451200 |
oct | 162650025341 |
9 | 43702322361 |
10 | 15411981025 |
11 | 6599730501 |
12 | 2ba1536601 |
13 | 15b7cc3acc |
14 | a62c27237 |
15 | 603092d6a |
hex | 396a02ae1 |
15411981025 has 27 divisors (see below), whose sum is σ = 22237265619. Its totient is φ = 10565236080.
The previous prime is 15411981019. The next prime is 15411981071. The reversal of 15411981025 is 52018911451.
It is a happy number.
The square root of 15411981025 is 124145.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 5548313169 + 9863667856 = 74487^2 + 99316^2 .
It is a de Polignac number, because none of the positive numbers 2k-15411981025 is a prime.
It is a super-2 number, since 2×154119810252 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 4343302 + ... + 4346848.
Almost surely, 215411981025 is an apocalyptic number.
15411981025 is the 124145-th square number.
15411981025 is the 62073-rd centered octagonal number.
It is an amenable number.
15411981025 is a deficient number, since it is larger than the sum of its proper divisors (6825284594).
15411981025 is an frugal number, since it uses more digits than its factorization.
15411981025 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7118 (or 3559 counting only the distinct ones).
The product of its (nonzero) digits is 14400, while the sum is 37.
Multiplying 15411981025 by its product of nonzero digits (14400), we get a square (221932526760000 = 148974002).
The spelling of 15411981025 in words is "fifteen billion, four hundred eleven million, nine hundred eighty-one thousand, twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •