Base | Representation |
---|---|
bin | 11100001101010011… |
… | …11110100110000001 |
3 | 1110002102012121102100 |
4 | 32012221332212001 |
5 | 222003334144441 |
6 | 10542421341013 |
7 | 1044166220241 |
oct | 160651764601 |
9 | 43072177370 |
10 | 15144053121 |
11 | 647147228a |
12 | 2b27867769 |
13 | 15746451a2 |
14 | a39401b21 |
15 | 5d97bbcb6 |
hex | 386a7e981 |
15144053121 has 24 divisors (see below), whose sum is σ = 22560071040. Its totient is φ = 9782017056.
The previous prime is 15144053077. The next prime is 15144053131. The reversal of 15144053121 is 12135044151.
15144053121 is a `hidden beast` number, since 1 + 51 + 440 + 53 + 121 = 666.
15144053121 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 15144053121 - 211 = 15144051073 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (15144053131) 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 23 ways as a sum of consecutive naturals, for example, 15555 + ... + 174728.
It is an arithmetic number, because the mean of its divisors is an integer number (940002960).
Almost surely, 215144053121 is an apocalyptic number.
It is an amenable number.
15144053121 is a deficient number, since it is larger than the sum of its proper divisors (7416017919).
15144053121 is a wasteful number, since it uses less digits than its factorization.
15144053121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 190565 (or 190562 counting only the distinct ones).
The product of its (nonzero) digits is 2400, while the sum is 27.
Adding to 15144053121 its reverse (12135044151), we get a palindrome (27279097272).
The spelling of 15144053121 in words is "fifteen billion, one hundred forty-four million, fifty-three thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •