Base | Representation |
---|---|
bin | 11100001101010011… |
… | …11110100110001011 |
3 | 1110002102012121102201 |
4 | 32012221332212023 |
5 | 222003334200011 |
6 | 10542421341031 |
7 | 1044166220254 |
oct | 160651764613 |
9 | 43072177381 |
10 | 15144053131 |
11 | 6471472299 |
12 | 2b27867777 |
13 | 15746451ac |
14 | a39401b2b |
15 | 5d97bbcc1 |
hex | 386a7e98b |
15144053131 has 2 divisors, whose sum is σ = 15144053132. Its totient is φ = 15144053130.
The previous prime is 15144053077. The next prime is 15144053137. The reversal of 15144053131 is 13135044151.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 15144053131 - 221 = 15141955979 is a prime.
It is a super-2 number, since 2×151440531312 (a number of 21 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 15144053131.
It is not a weakly prime, because it can be changed into another prime (15144053137) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7572026565 + 7572026566.
It is an arithmetic number, because the mean of its divisors is an integer number (7572026566).
Almost surely, 215144053131 is an apocalyptic number.
15144053131 is a deficient number, since it is larger than the sum of its proper divisors (1).
15144053131 is an equidigital number, since it uses as much as digits as its factorization.
15144053131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3600, while the sum is 28.
Adding to 15144053131 its reverse (13135044151), we get a palindrome (28279097282).
The spelling of 15144053131 in words is "fifteen billion, one hundred forty-four million, fifty-three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •