Base | Representation |
---|---|
bin | 11010001010000011… |
… | …11111010001111011 |
3 | 1100020200110220121212 |
4 | 31011001333101323 |
5 | 212230010114011 |
6 | 10241251153335 |
7 | 1004666652014 |
oct | 150501772173 |
9 | 40220426555 |
10 | 14043051131 |
11 | 5a56a3318a |
12 | 287aba584b |
13 | 142a503415 |
14 | 9730c200b |
15 | 572cd908b |
hex | 34507f47b |
14043051131 has 4 divisors (see below), whose sum is σ = 14187824952. Its totient is φ = 13898277312.
The previous prime is 14043051103. The next prime is 14043051149. The reversal of 14043051131 is 13115034041.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 14043051131 - 230 = 12969309307 is a prime.
It is a super-2 number, since 2×140430511312 (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 = 14043051097 and 14043051106.
It is not an unprimeable number, because it can be changed into a prime (14043051101) 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 in 3 ways as a sum of consecutive naturals, for example, 72386765 + ... + 72386958.
It is an arithmetic number, because the mean of its divisors is an integer number (3546956238).
Almost surely, 214043051131 is an apocalyptic number.
14043051131 is a deficient number, since it is larger than the sum of its proper divisors (144773821).
14043051131 is an equidigital number, since it uses as much as digits as its factorization.
14043051131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 144773820.
The product of its (nonzero) digits is 720, while the sum is 23.
Adding to 14043051131 its reverse (13115034041), we get a palindrome (27158085172).
The spelling of 14043051131 in words is "fourteen billion, forty-three million, fifty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •