Base | Representation |
---|---|
bin | 11011000001111000… |
… | …10011000000101011 |
3 | 1101110022121111022012 |
4 | 31200330103000223 |
5 | 214204344234011 |
6 | 10355535550135 |
7 | 1022414123456 |
oct | 154074230053 |
9 | 41408544265 |
10 | 14511321131 |
11 | 617729838a |
12 | 298b98b34b |
13 | 14a3528c68 |
14 | 9b937849d |
15 | 59de85a8b |
hex | 360f1302b |
14511321131 has 4 divisors (see below), whose sum is σ = 14529215064. Its totient is φ = 14493427200.
The previous prime is 14511321113. The next prime is 14511321151. The reversal of 14511321131 is 13112311541.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 13112311541 = 7 ⋅1873187363.
It is a cyclic number.
It is not a de Polignac number, because 14511321131 - 26 = 14511321067 is a prime.
It is a super-2 number, since 2×145113211312 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 14511321097 and 14511321106.
It is not an unprimeable number, because it can be changed into a prime (14511321151) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8945750 + ... + 8947371.
It is an arithmetic number, because the mean of its divisors is an integer number (3632303766).
Almost surely, 214511321131 is an apocalyptic number.
14511321131 is a deficient number, since it is larger than the sum of its proper divisors (17893933).
14511321131 is an equidigital number, since it uses as much as digits as its factorization.
14511321131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17893932.
The product of its digits is 360, while the sum is 23.
Adding to 14511321131 its reverse (13112311541), we get a palindrome (27623632672).
The spelling of 14511321131 in words is "fourteen billion, five hundred eleven million, three hundred twenty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •