Base | Representation |
---|---|
bin | 11010101101000111… |
… | …00111111100101011 |
3 | 1101000011202011221212 |
4 | 31112203213330223 |
5 | 213330243044011 |
6 | 10330353223335 |
7 | 1015200115232 |
oct | 152643477453 |
9 | 41004664855 |
10 | 14337081131 |
11 | 60979aa28a |
12 | 2941561b4b |
13 | 14763c0a79 |
14 | 9a017db19 |
15 | 58da1908b |
hex | 3568e7f2b |
14337081131 has 4 divisors (see below), whose sum is σ = 14338598064. Its totient is φ = 14335564200.
The previous prime is 14337081127. The next prime is 14337081149. The reversal of 14337081131 is 13118073341.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 13118073341 = 17 ⋅771651373.
It is a cyclic number.
It is not a de Polignac number, because 14337081131 - 22 = 14337081127 is a prime.
It is a super-2 number, since 2×143370811312 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (14337081331) 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, 744200 + ... + 763221.
It is an arithmetic number, because the mean of its divisors is an integer number (3584649516).
Almost surely, 214337081131 is an apocalyptic number.
14337081131 is a deficient number, since it is larger than the sum of its proper divisors (1516933).
14337081131 is an equidigital number, since it uses as much as digits as its factorization.
14337081131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1516932.
The product of its (nonzero) digits is 6048, while the sum is 32.
The spelling of 14337081131 in words is "fourteen billion, three hundred thirty-seven million, eighty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •