Base | Representation |
---|---|
bin | 11100110001101011… |
… | …01000111110000001 |
3 | 1110212200012121021212 |
4 | 32120311220332001 |
5 | 223114432201121 |
6 | 11032555455505 |
7 | 1054562120225 |
oct | 163065507601 |
9 | 43780177255 |
10 | 15449100161 |
11 | 6608683680 |
12 | 2bb1a57595 |
13 | 15c28bc2b1 |
14 | a67b2a785 |
15 | 60647625b |
hex | 398d68f81 |
15449100161 has 32 divisors (see below), whose sum is σ = 18121501440. Its totient is φ = 13029068800.
The previous prime is 15449100151. The next prime is 15449100167. The reversal of 15449100161 is 16100194451.
15449100161 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 15449100161 - 26 = 15449100097 is a prime.
It is a super-2 number, since 2×154491001612 (a number of 21 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (15449100167) 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, 1790225 + ... + 1798833.
It is an arithmetic number, because the mean of its divisors is an integer number (566296920).
Almost surely, 215449100161 is an apocalyptic number.
15449100161 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
15449100161 is a deficient number, since it is larger than the sum of its proper divisors (2672401279).
15449100161 is a wasteful number, since it uses less digits than its factorization.
15449100161 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8857.
The product of its (nonzero) digits is 4320, while the sum is 32.
The spelling of 15449100161 in words is "fifteen billion, four hundred forty-nine million, one hundred thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •